do t flagti]-true while (1lag[j]) if (turnj) flag[i]-false: while (turnj) :do nothing/ flag [1]-true: /critical section/ turn = j; flag[i] -false: /remainder section/ l while (tue) Scheme 1: The structure of process P. in Deker's algorithm The first known correct software solution to the critical-section problem for two processes was boolean flag[2]; int turn initially false The structure of process Pi (i0 or 1) is shown above. The other process is Pi G1 or 0). Prove that the algorithm satisfies all three requirements for the critical