Q50

Consider the following proposed solution for the critical section problem. There are $n$ processes : $P_0....P_{n-1}$. In the code, function $\text{pmax}$ returns an integer not smaller than any of its arguments .For all $i,t[i]$ is initialized to zero. Code for $P_i$; do { c[i]=1; t[i]= pmax (t[0],....,t[n-1])+1; c[i]=0; for every j != i in {0,....,n-1} { while (c[j]); while (t[j] != 0 && t[j] <=t[i]); } Critical Section; t[i]=0; Remainder Section; } while (true); Which of the following is TRUE about the above solution?