Q1 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: 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 (betweenOand n-1). The structure of process Pi is shown below Prove that the algorithm satisfies all three requirements for the critical-section problem, namely: Mutual exclusion - Progress Bounded waiting while (true) ( flag[i] wt in; turn; while (j-i) { if (flag[j] !-idle) j-turn; else j (j + 1) % n; flag [i] = in cs; while ( (j )&&(turn-i flag [turn] -idle)) break; /critical section */ (turn + 1) % n; (j + 1) % n; while (flag [j]-idle) j turn flag[i]idle /*remainder section */ ) while (true) Q1 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: 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 (betweenOand n-1). The structure of process Pi is shown below Prove that the algorithm satisfies all three requirements for the critical-section problem, namely: Mutual exclusion - Progress Bounded waiting while (true) ( flag[i] wt in; turn; while (j-i) { if (flag[j] !-idle) j-turn; else j (j + 1) % n; flag [i] = in cs; while ( (j )&&(turn-i flag [turn] -idle)) break; /critical section */ (turn + 1) % n; (j + 1) % n; while (flag [j]-idle) j turn flag[i]idle /*remainder section */ ) while (true)