Consider the following set of processes, with the length of the CPU-burst time given in milliseconds.

Process	Burst Time	Priority
P1	10	3
P2	1	1
P3	2	3
P4	1	4
P5	5	2

The processes are assumed to have arrived in the order P1, P2, P3, P4, P5, all at time 0.

a. Draw four Gantt charts that illustrate the execution of these processes using FCFS, SJF, a nonpremptive priority ( a smaller number implies higher priority ), and RR ( quantum = 1 ) scheduling.

b. Calculate the turnaround time of each process for each of the scheduling algorithms in part a).

c. Calculate the waiting time of each process for each of the scheduling algorithms in part a).

d. Which of the schedules in part a) results in the minimal average waiting time ( over all processes )?