Problem E. Assuming that each eating operation takes 5 ms, an eating operation won't be interrupted, Pi (i-0,1,... 4) are the five processes, one for each philosopher, and wait () and signal () for a condition are defined in Slide 3.27, for the code to solve the Dining Philosophers problem in Slides 3.46 through 3.48, if P0 wants to eat at 1 ms, both P4 and P1 want to eat at 2 ms, and P3 wants to eat at 3 ms, draw a time line to illustrate eat operations by marking the beginming and ending moments of each eat operation of each philosopher what are the values of state[i] fori -0, 1, ..., 4 at 0.5 ms, 1.5 ms, 2.5 ms, 3.5 ms, 4.5 ms, 5.5 ms, and 6.5 ms? what are the waiting queue sizes of conditions self [i] for i = 0 , 1 , , 4 at 0.5 ms, 1.5 ms, 2.5 ms, 3.5 ms, 4.5 ms, 5.5 ms, and 6.5 ms? (Hint: a size of 0 means no process is suspended to wait for this condition.) Problem E. Assuming that each eating operation takes 5 ms, an eating operation won't be interrupted, Pi (i-0,1,... 4) are the five processes, one for each philosopher, and wait () and signal () for a condition are defined in Slide 3.27, for the code to solve the Dining Philosophers problem in Slides 3.46 through 3.48, if P0 wants to eat at 1 ms, both P4 and P1 want to eat at 2 ms, and P3 wants to eat at 3 ms, draw a time line to illustrate eat operations by marking the beginming and ending moments of each eat operation of each philosopher what are the values of state[i] fori -0, 1, ..., 4 at 0.5 ms, 1.5 ms, 2.5 ms, 3.5 ms, 4.5 ms, 5.5 ms, and 6.5 ms? what are the waiting queue sizes of conditions self [i] for i = 0 , 1 , , 4 at 0.5 ms, 1.5 ms, 2.5 ms, 3.5 ms, 4.5 ms, 5.5 ms, and 6.5 ms? (Hint: a size of 0 means no process is suspended to wait for this condition.)