The first known correct software solution to the critical-section problem for n processes with a lower bound on waiting of n1 turns was presented by Eisenberg and McGuire. The processes share the following variables: enum pstate { idle, want_in, in_cs } pstate flag[n]; int turn; All the elements of flag are initially idle. The initial value of turn is immaterial (between 0 and n - 1). The structure of process Pi is shown below. Prove that (describe possible correctness and consider different scenarios) the algorithm satisfies all three requirements for the critical-section problem, namely: The first known correct software solution to the critical-section problem for n processes with a lower bound on waiting of n1 turns was presented by Eisenberg and McGuire. The processes share the following variables: enum pstate { idle, want_in, in_cs } pstate flag[n]; int turn; All the elements of flag are initially idle. The initial value of turn is immaterial (between 0 and n - 1). The structure of process Pi is shown below. Prove that (describe possible correctness and consider different scenarios) the algorithm satisfies all three requirements for the critical-section problem, namely