Question #1: The first known correct software solution to the critical-sectionproblem for two processes was developed by Dekker. The twoprocesses, P0 and P1, share the following variables: boolean flag[2]; /* initially false*/ int turn; The structure of process Pi ( i = = 1 or 0 ) is shown below; theother process is pj ( j = = 1 or 0 ). Prove that the algorithmsatisfies all three requirements for the critical-section problemwhich are: (1) Mutual exclusion (2) Progress (3) Bounded waiting. do { flag [i] = TRUE; while ( flag [j] ) { if( turn = = j ) { flag [i] = false ; while ( turn = = j ); // do nothing flag [i] = TRUE ; } } // critical section turn = j ; flag [i] =false ; // remindersection }while ( TRUE ) ;