Consider the following code for two concurrent processes: Flag[0], Flag[1] = False; Process 0 while (true){ } L1: flag[0] = true; while (flag[1]) { Turn=0 process 1 while(true) { if (turn == 0) { flag [0] = False; } while (turn=1) go to L1; CS Turn = 1; Flag[0] = False; remainder section; L1: flag[1]= true; while (flag[0]) { if (turn == 1) { flag[1] = False; } while (turn :0) go to L1; } Turn = 0; Flag[1] = False; remainder section; } CS 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)