This is not a coding question. I want to know if this code satisfies the critical section problem requirments or not. Show explanation!

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: 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 Pris shown in the following Figure. Prove that the algorithm satisfies all three requirements forthe critical-section problem. do { while (true) { flag[i] = want.in; j - turn; while (!= i) { if (flag[j] != idle) { j = turn; else j - (j + 1) % n; } flag[i] = in.cs; j = 0; while ((j= n) && (turn == i || flag(turn) == idle)) break; } /* critical section / j = (turn + 1) % n; while (flag[j] = idle) j = (j + 1) % n; turn = j; flag[i] = idle; /* remainder section */ } while (true)