insert Litation - Bibliography Citations & Bibliography Caption Cross-reference Captions Mark Entry Mark Citation Index Ch-6 1. The first known correct software solution to the critical-section problem for n processes with a lower bound on waiting of n-1 tums was presented by Eisenberg and McGuire. The processes share the following vanables: enumpstate (idle, want_in, in_cs); pstate flagin); int turn; All the elements of flag are initially idle. The initial value of turn isimmaterial (between and n-1). The structure of process is shown in the following Figure. Prove that the algorithm satisfies all three requirements forthe critical-section problem do! while (true) flagti) - want in 3 - turn; while (!) if (lagt;] - idle) { 3 - turn; else j=0.1) % n; } tlag(i) - in.ca while (n) == 1 11 flag] = in.ca)) an) ** (turn 11 tag(turn) break; idle)) 3 / critical section / J - (1) while (flug [o] - idle) 3 -0.1) ; flagli) - idle 1 while tre