Exercise 3.3.5: Scheduling with MLF. About A MLF algorithm riority levels. At level 5, a process executes for Q = 1 ms. At each of the lower levels the quantum is doubled (20.40.8Q. 160). The following processes are to be scheduled: Process Arrival Total CPU time p10 1 3 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 1 Draw a 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 (6) Determine the ATT for each process Exercise 3.3.5: Scheduling with MLF. About A MLF algorithm riority levels. At level 5, a process executes for Q = 1 ms. At each of the lower levels the quantum is doubled (20.40.8Q. 160). The following processes are to be scheduled: Process Arrival Total CPU time p10 1 3 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 1 Draw a 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 (6) Determine the ATT for each process