Computer Science · Operating Systems

Which of the following statements are correct regarding Peterson's Solution for the critical-section problem? I. It utilizes a shared boolean flag array to indicate a process's interest in entering the critical section. II. In the entry section, a process sets its own flag to true and assigns the turn variable to itself to ensure immediate entry. III. The algorithm satisfies the requirements of mutual exclusion, progress, and bounded waiting. IV. A significant limitation of this solution is that it involves busy waiting and is designed specifically for only two processes. Choose the most appropriate answer from the options given below: