The first known correct software solution to the critical-section problem for two processes was developed by Dekker. The two processes, P and P1, share the following variables: boolean flag[2]; int turn; The structure of process Pi(i==0 or 1) is shown below in Figure 1.1; the other process is Pi(j==1 or 0). Prove that algorithm satisfies all three requirements for the critical-section problem. (6 Marks)