There are five processes (P1, P2, P3, P4 and P5) in a ready list waiting to be processed. Their respective total CPU times are 10, 1, 2, 1, and 5, respectively. Assume that the jobs arrived at the same time but were queued in the given order where P1 is at the head of the list and P5 is at the tail.

(a) For the following scheduling policies, draw a time chart showing when each of the five processes will be executed (assume context switch time to be negligible): First In First OUT (FIFO), Round Robin (RR), and Shortest Job First (SJF). Start at time 0. Time quantum not given for RR, so I assumed it as 1

(b) Determine the turnaround time for each process (that is, how many units of CPU time the process stays around in the system until it is completed), under each of the policies of part (a).

(c) Which policy yields the minimum average waiting time (over all processes)?