Consider three concurrent processes $P_1, P_2$, and $P_3$ sharing a single counting semaphore $\verb|S|$ initialized to $\mathbf{2}$. Each process executes the following sequence of operations exactly once:
wait(S);
// Critical Section
signal(S);
signal(S);
Which of the following statements is/are TRUE after all three processes have finished execution?
- THE MAXIMUM POSSIBLE VALUE OF THE SEMAPHORE $\verb|S|$ IS $5$.
- THE MINIMUM POSSIBLE VALUE OF THE SEMAPHORE $\verb|S|$ IS $2$.
- DEADLOCK IS NOT POSSIBLE IN THIS SCENARIO.
- AT MOST TWO PROCESSES CAN BE IN THE CRITICAL SECTION SIMULTANEOUSLY AT ANY POINT.
