Consider the following workload:

a. Show the schedule using shortest remaining time, non-preemptive priority (a smaller priority number implies higher priority) and round robin with quantum 30 ms. Use time scale diagram as shown below for the FCFS example to show the schedule for each requested scheduling policy.
Example for FCFS (1 unit = 10 ms):

b. What is the average waiting time of the above scheduling policies?

ProcessBurst Time Priority Arrival Time P1 P2 P3 P4 50 ms 20 ms 100 ms 40 ms 4 0 ms 20 ms 40 ms 60 ms P1 P1 P1 P1 P1 P2 P2 P3 P3 P3 P3 P3 P3 P3 P3 P3 P3 P4 P4 P4 P4 0 123 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20