Consider the following set of processes, with the length of the CPU burst given in milliseconds:

Process	Arrival Time	CPU Burst Time	Priority
p1	0	10	2
p2	1	1	4
p3	3	3	2
p4	6	7	0
p5	10	2	1

(a) Draw six Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: FCFS, SJF, SRTF, RR (quantum 1), and RR (quantum=3), and non-preemptive priority (a smaller priority number implies a higher priority). (3 points)

(b) What is the turnaround time of each process for each of the scheduling algorithm in part (a)? (1 point)

(c) What is the waiting time of each process for each of the scheduling algorithms in part (a)? (1 point)