2. 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 (21 int turn; The structure of process P (==0 or 1) is shown below in Figure 1.1; the other process is Pic==1 or 0). Prove that algorithm satisfies all three requirements for the critical-section problem do { flag(i=true; While(flag]X If(turn==j) { flag[i]=false; While(turn==j) ;//do nothing flag[i]=true; } } //critical section turn=j; flag[i=false; //remainder section } while(true); (10 Marks)