Consider the following two-process synchronization solution.Process 0 Process 1 --------- --------- Entry: loop while (turn == 1); Entry: loop while (turn == 0); (critical section) (critical section) Exit: turn = 1; Exit: turn = 0;The shared variable turn is initialized to zero. Which one of the following is TRUE?

This algorithm is the classic strict alternation (or lock with turn variable) solution for two processes.

1. Mutual Exclusion: Satisfied. The shared variable turn can only hold either $0$ or $1$ at any time, so both processes can never be in the critical section simultaneously.

2. Progress: Violated. The processes are forced to take turns strictly in the sequence $0, 1, 0, 1, \dots$. If Process $0$ finishes its critical section and sets turn = 1, and then Process $1$ completes its turn and sets turn = 0, Process $1$ cannot re-enter the critical section if Process $0$ is not interested in entering. Thus, a process outside its critical section prevents another process from entering.

3. Bounded Waiting: Satisfied. Neither process has to wait for more than one turn.

Therefore, the solution violates the progress requirement, making (C) the correct option [CS-2, Q48].