oo T-Mobile 2:18 MIDTERN NEW.docx Q4 4.1 (22 points) Consider the following code for two flag[0] false; flas[1]-false; turn-0; PO while(true) \ P1 while(true) turn-0 L1: turn= 1 LI: flag[0] true; flag[1]-true while(Flag[l] while(flag[O]) if(turn==l) { flag[0] false;} if(turn0 flagfalse) while(turn go to L1; while(turn0) go to Ll CS CS flag[1] false; remainder flag[0]-false remainder section; section; Is the NO DEADLOCK condition always satisfied? (If yes, explain why; if not, give the sequence that violates the condition) Is the NO STARVATION condition always satisfied? (If yes, explain why; if not, give the sequence that violates the condition) 4.2 (10 points) Discuss the NO STARVATION ANID MUTUAL EXCLUSION condition for PETERSON SOLUTION tum-o flag[0] false; flag 1] = false