2(20 pts) The following algorithm attempts to implement a critical section for two concurrent threads TO and T1. Can this implementation guarantee mutual exclusion and no starvation? Please explain why or why not. Note you will not get any credit if you do not explain. /flag[ is a boolean array; and turn is an integer flag[0] =false; flag[1]false; turn; To: flag[0] true; turn = 1; while (flag[1]true && turn-1) // busy wait // critical section // end of critical section flag[0] false; Ta flag[1] = true; turn - 0; while (flag[0] true && turn-0) // busy wait // critical section // end of critical section flag[1] = false; 2(20 pts) The following algorithm attempts to implement a critical section for two concurrent threads TO and T1. Can this implementation guarantee mutual exclusion and no starvation? Please explain why or why not. Note you will not get any credit if you do not explain. /flag[ is a boolean array; and turn is an integer flag[0] =false; flag[1]false; turn; To: flag[0] true; turn = 1; while (flag[1]true && turn-1) // busy wait // critical section // end of critical section flag[0] false; Ta flag[1] = true; turn - 0; while (flag[0] true && turn-0) // busy wait // critical section // end of critical section flag[1] = false