operating system

3. S0=1,51=0,S2=0 A while (true) B C 1 wait(51) wait(52) A1:wait(S0) B1:signal (50) C1:signal(S0) A2:print("0") A3:5ignal(51) A 4:5ignal(52) ] How many times will 0 be printed? Write the sequence of instructions to justify your answer. 4. 51, Each process Pi,l=0,1,,9 is defined as follows. P10 has only signal(5) Piwait(S){criticalsection)signal(S)P10signall(S) What is the largest number of processes that can be inside the critical section at any moment. Explain your answer. All semaphores are initialized to 1 . Find the DEADLOCK FREE ordering of wait operations by the processes. That is reorder the wait operations in each process 50 deadlock is not possible. As an example the order X1,Y1,21,22 in the above example causes a deadlock