Consider the following solution to the critical section problem for two processes, P1 and P2, that share only an integer variable turn that is initially set to 1. The variable turn is tested and updated only where shown. P1 while (true) P2 while ( true non-critical-section code while (turn1) non-critical-section code while ( turn 2 ) // wait // wait end while critical-section turn2 non-critical-section code end while critical-section turn ? 1 non-critical-section code end while end while Which of the following is (are) true about this solution? I. It guarantees mutual exclusion. IL It guarantees that a process can enter its critical section if the other process is not in its critical section (ie, progress). Ill. It is susceptible to deadlock. O A) Ionly O B) II only ?C) I and II only OD) I and III only OE) I,II, and