d) Peterson's Algorithm: Given a code for Process 0 and Process 1 in Table 4. Fill in flags and turn variables if Process 1 initiates the request to enter the critical section. [3 Marks] Table 4 Process 1 do { Process o do { flag[0] = TRUE; turn = 1; while (flag[1] && turn == 1) ; /* do nothing */ critical section flag[0] = FALSE; remainder section | } while (TRUE); flag[1] = TRUE; turn = 0; while (flag[0] && turn == 0) ; /* do nothing */ critical section flag[1] = FALSE; remainder section } while (TRUE); Table 5 time flag[0] flag[1] Turn Events t 0 FALSE TRUE 0 P request to enter CS 1 t P enters CS 1 t 2 P requests to enter CS 0 t 3 P executes RS 1 t Penters CS 0 t 5 P executes RS 1 to P executes RS 0 t 7 P executes RS 1 t 8 P requests to enter CS 0