10) Consider the following set of processes, with the length of the CPU burst time given in milliseconds: Process Burst-TimePriority P1 P2 P3 2 P43 P5 5 4 The processes are assumed to have arrived in the order P1, P2, P3, P4, P5, all at time 0 (a) Draw four Gantt charts illustrating the execution of these processes using FCFS, SJF, a y number implies a higher priority), and RR (quar 1) scheduling. (b) What is the turnaround time of each process for each of the scheduling algorithms in part 2 (c) What is the waiting time of each process for each of the scheduling algorithm s in part (a)? (d) Which of the schedules in part a results in the minimal average waiting time (over all processes)? (10 points)