1. The first known correct software solution to the critical-section problem for n processes with a lower bound on waiting of n-1 turns was presented by Eisenberg and McGuire. The processes share the following variables: enumpstateidie, want_in, in_cs}; pstate flag(n): int turn; All the elements of flag are initially idle. The initial value of turn isimmaterial (between 0 and n-1). The structure of process Pris shown in the following Figure. Prove that the algorithm satisfies all three requirements forthe critical-section problem. do ! while (true){ flag (1) - vant.in; j - turn; while (1) it (ilag () idle) { j - turn; j. (+1) % n; } flag[1] - in.cs: - 0; while ((n) tk (turn - i ll flag (turn) -- idle)) break; 1 critical section / j - (turn + 1) % n; while (flag (j) -- idle) 1 -0.1) %; turn; flag (1) - idle; /* remainder section / } while (true); Ch-6 1. The first known correct software solution to the critical-section problem for processes with a lower bound on waiting of n-1 turns was presented by Eisenberg and McGuire. The processes share the following variables: enumpstate idle, want_in, in_cs) pstate flag(n): int turn; All the elements of flag are initially idle. The initial value of turn isimmaterial (between 0 and n-1). The structure of process Pi is shown in the following Figure. Prove that the algorithm satisfies all three requirements forthe critical-section problem do { while (true) Ilag[i] - want.in turn; while (!) if (lag) tidle) turn; 3-01) %; } flag[] - in.cs; j = 0; while ( ja) ** () - 1 l flag[j] = in.ca else 11 ( - ) a (turn - 1 Il flag [turn] - 1d2e) break; > /* critical section J-(turn + 1) : while (flag[j] - idle) turn- flaxtil - idlo: /* remainder section / while (true); Ch-7