A solution to the critical-section problem must satisfy the following three requirements 1. Mutual exclusion. If process P, is executing in its critical section, then no other processes can be executing in their critical sections. 2. Progress. If no process is executing in its critical section and some processes wish to enter their critical sections, then only those processes that are not executing in their remainder sections can participate in deciding which will enter its critical section next, and this selection cannot be postponed indefinitely. Now, consider the following two methods used by processes P1 and P2 for accessing critical sections. Assume that the initial value of shared Boolean variables, S1 and S2, are randomly assigned. P2 while (S1- S2); /*Critical Section* P1 while(S1 S2); Critical Section S1-S2 As P1 and P2 execute on a system, which of the following conditions will be true? a) Mutual Exclusion and Progres:s b) Mutual Exclusion but NO Progress c) NO Mutual Exclusion but Progress d) NO Mutual Exclusion and NO Progress (Hints: Read pages 23- 28 on Peterson's Solution from the notes. Also, try different combination of values for S1 and S2 i.e., (S1, S2) (0,1) or (S1,S2)-(1,1) and so on)