Consider the following code for two concurrent processes: Flagl0], Flag1]-False; Turn 0 Process0 while (true) process 1 while(true) \ 1: flag|0|=true; while (flagl) flag! 1-true; while (flag[O]) I if(turn-= 1) { flag[I-False; } LI: if(turn 0) { flag 101-False; } while (turn1) go to Ll; while (turn0) go to Ll; CS CS Turn 1; Flagl0] False; remainder section; Turn = 0; Flag1]- False; remainder section; 1) Discuss if the condition of No Starvation is satisfied. (if yes, explain why, if no, explain why not - give the execution sequence) 2) Discuss if the Mutual Exclusion Condition is satisfied. (if yes explain why, if no, explain why not - give the execution sequence)