Discuss the NO STARVATION AND MUTUAL EXCLUSION conditions for PETERSON SOLUTION turn 0; flag[o] false; flag[1]= false; PO while(true)H P1 while(true)X flag[O] true; turn =1; while (flag[1] and turn =-1) do no-op: flag[1] true; turn 0 while (flag[O] and turn =#0) do no-op: CS flag[O) false; remainder section; CS flag[1] false; remainder section; Q.2.2 (20 points) FULL CREDIT Consider the following pseudo-code for three concurrent processes P (0 si s2) Initialization: turn0; (shared variable) flagt J false; For example the code for Po will be: Po() while(true) while(truek flag[0] true flag[i] true; while( (turn l-|) AND (flag[(i+1 )%3] OR flag[(i+2%3DXY while(turn !: 0)AND(flagr?OR flagi2)) cS CS flag[o] false turns (0+1)%3; remainder section; flag[li] false; turn 1 turn # (i+1)%3; remainder section; NOTE: I hope you know about logical AND, OR operations a) NO DELAY condition is not satisfied. Give the execution sequence that will show the violation of the condition. b) Is the MUTUAL EXCLUSION condition satisfied? If yes, explain why (prove it), if no, give the execution sequence that will show the violation of the condition