Use peterson algorithm in os to solve it

2 b) For Peterson's problem, the conditions below will apply. Each statement will take 3ms to complete. For process o: i=0,j=1; and for process 1: i=1,j=0. Context switching will occur after every 9ms. In the critical section area, there are only 2 statements. The remaining section area contains only 1 statement. Information common to both processes: turn=0; flag[@]=FALSE; flag[1]=FALSE; Complete the following table up to 45ms in the timeline considering the above conditions and information. In the table, you will write the corresponding lines of code each process executes in that time slot. Process o Process 1 Timeo 45 The pseudocode for Peterson's solution is given below for any process Ps, do { flag[i] = true; turn- j; while (flag[j] && turn == j); critical section flag[i] = false; remainder section } while (true)