Given the following solution for the critical section problem (the given code is for process Pi; code for Pj is the same with i and j interchanged), show one scenario where it does not satisfy the progress requirement. Here, flag[i] and flag[j] are shared variables initialized to false. turn is also a shared variable initialized to i.

 do{ 

 /* Begin Entry Section */ 

 flag[i]=true; 

 while (flag[j] || (turn==j)); /* End Entry section */ Critical section /* Begin Exit section */ flag[i]=false; turn=j; /*End exit section */ Remainder section }