For the Petersons solution, for the enter_region called by process 0 and process 1, show all possible combinations, interleaving of the execution paths, focusing on testing the while-loop. Will there be any violation of mutual execution? Explain showing all possible cases. Thanks!

Peterson's Solution (1981) #define FALSE 0 #define TRUE #define N 2 /* number of processes */ int turn; int interested[N]; /* whose turn is it? / /* all values initially 0 (FALSE) */ void enter_region(int process); /* process is 0 or 1 */ int other; /* number of the other process/ other = 1-process; interested[process] TRUE; turn = process; while (turn-process && interested[other] = TRUE) /* null statement */ ; /* the opposite of process */ /* show that you are interested / /* set flag/ void leave_region(int process) * process: who is leaving* interested[process] = FALSE; /* indicate departure from critical region */