Assume two processes i and j. Process i is listed below. Process j is identical, except with the i's and j's reversed. The variable turn and the array ag[] are shared. Assume that the flag array is initialized to false and that turn is initialized to either i or j.

Does this algorithm ensure mutual exclusion? (yes or no). If not, give a brief counter example. If yes, does it solve all of the problems associated with concurrent access?

(4 marks). Assume two processesi and j. Process i is listed below. Process j is identical, except with the i's and j's reversed. The variable turn and the array flagl are shared. Assume that the flag array is initialized to false and that turn is initialized to either i or j PROCESS i: while (1.) flag[i]true; turnj while (flag[j] && (turn j)); /*busy wait */ CRITICAL SECTION flag [i] false; = NON-CRITICAL SECTION oes this algorithm ensure mutual exclusion (yes or no). If not, give a briet counter example. yes, does it solve all of the problems associated with concurrent access