5. In the class, we have discussed only about message passing algorithms for mutual exclusion, but have not looked at the shared-memory algorithms. We now study a mutual exclusion algorithm on the shared memory model. The following two-process algorithm claims to solve the mutual exclusion algorithm. Both processes have read and write access to the shared variables x and y: program resolve {program for process is i E (1,2}} define x-integer, y: boolean initially y = false do true start: X'=i; If y do y skip od; {busy waiting loop) goto start fl, y:= true; If Xi y:=false; do x#0 skip od; {busy waiting loop) goto start; fi; critical section; y:=false; x:= 0; non-critical section; od (a) Does it satisfy the requirements of a correct solution? Explain in detail. (b) If N processes 1,2,...,N (N> 2) execute the above algorithm, then what is the maximum number of processes that can be in their critical sections concurrently. 5. In the class, we have discussed only about message passing algorithms for mutual exclusion, but have not looked at the shared-memory algorithms. We now study a mutual exclusion algorithm on the shared memory model. The following two-process algorithm claims to solve the mutual exclusion algorithm. Both processes have read and write access to the shared variables x and y: program resolve {program for process is i E (1,2}} define x-integer, y: boolean initially y = false do true start: X'=i; If y do y skip od; {busy waiting loop) goto start fl, y:= true; If Xi y:=false; do x#0 skip od; {busy waiting loop) goto start; fi; critical section; y:=false; x:= 0; non-critical section; od (a) Does it satisfy the requirements of a correct solution? Explain in detail. (b) If N processes 1,2,...,N (N> 2) execute the above algorithm, then what is the maximum number of processes that can be in their critical sections concurrently