Assume that the following processes are the only processes in a computer system and that there are no input/output requests from all the given processes. Given the following arrival time and CPU burst time for each process. The scheduling is preemptive by priority. So, the arrival of a higher priority process will cause a context switch.

Answer the following questions.

Draw the Gantt chart and compute the average waiting time and Average Turn around time for the following CPU scheduling algorithms.

Round-Robin with a time quantum of 4 (without priority)

Process ID Arrival Time Priority Burst Time P1 P2 o 00N P3 - P4 - P5 ~