Peterson's solution requires the two processes to share two data items: int turn; boolean flag[2]; The structure of process Pi (i=0 or 1) is shown in Figure given below. The other process is Pj (j == 1 or 0). Prove that the algorithm satisfies all three requirements for the critical-section problem. Open with while (true) { flag[i] = true; turn = j; while (flag[j] && turn == ; /* critical section */ flag[i] false; /*remainder section */ } j)