1. A MLF algorithm uses 5 priority levels. At level 5, a process executes for Q = 1 ms. At each of the lower levels the quantum is doubled (20.4Q. 8Q, 160). The following processes are to be scheduled: Process Arrival Total CPU time pl 0 1 p2 1 3 p3 1 14 After termination, process p1 blocks for 4 ms and then reenters the queue again at level 5. Similarly, process p2 blocks for 5 ms and then reenters the queue again at level 5 (a) Draw a Gantt Chart (timing diagram) for the first 33 ms. On each of the 3 lines (one per process) show when the process is running and at which priority level. (1) Determine the Average Turn Around Time for each process. Make a table of Arrival time. Completion Time, Turn Around Time and WaitTime of the processes