please type the answer, not handwritten. Thank you

Consider a single processor, single core environment. Somebody suggested the following solution to the critical section problem involving two processes Po and Pi. It uses two shared variables turn and flag. Note that this is not the Peterson's solution discussed in class, but looks similar: boolean flag [2]; // Initially False int turn; // Initially O flaglil True; i0 for Po and 1 for P1 while (flaglj]True//-1-i if (turnj) flagli] - False; while (turnj) // Do nothing: just busy wait flagli] True; //Critical section code here turnj; flaglil False; // Remainder section code here while (True) The above is the code for process Pi, i 0 or 1. The other process is Pj, where j-1 - i. Now answer the following questions: a) Will the solution satisfy mutual exclusion of the critical section? You must prove or argue (in a way similar to we did in class for Peterson's solution) your answer b) Will the solution satisfy the "progress" requirement? You must prove your answer c) Will the solution satisfy the bounded waiting requirement? If so, what is the bound? You must prove your