The first known correct software solution to the critical-section problem for two processes was developed by Dekker. The two processes, Po and P, share the following variables: 5.10 boolean flag [2]; /* initially false */ int turn; The structure of process P (i == 0 or 1) is shown in Figure 5.25. The other process is Pj (j 1 or 0). Prove that the algorithm satisfies all three requirements for the critical-section problem. do flag[i] true; while (flag[jl) f if (turn j) flag[i]- false; while (turnj) ; /* do nothing*/ flag[i] - true; /* critical section / turnj; flag [i] false; / remainder section / while (true); Figure 5.25 The structure of process P in Dekker's algorithm