6. Consider the following set of processes, with the length of the CPU burst given in milliseconds: Arrival time CPU Burst time Process P1 P2 P3 P4 P5 Priorit 10 4 6 10 (a) Draw six Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: FCFS, SJF, SRTF, RR (quantum1), and RHR (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 cach 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)