Please show all work

The first known correct software solution to the critical section problem for n processes with a lower bound on the waiting time of n-1 was presented by Eisenberg and McGuire. The processes share the following variables: 2. enum pstatefidle, want_in, in_cs; pstate flag[n]; int turn All the elements of flag are initially idle. The initial value of turn is 0. The structure of the processes is as illustrated in the attached figure. Prove that the algorithm satisfies all the three requirements of the critical