(Solved): Question 1 [Points 10] Consider the following set of six processes, with the arrival times, CPU burs ...

Question 1 [Points 10] Consider the following set of six processes, with the arrival times, CPU burst time (in milliseconds), and priority. Process |Arrival Burst time |Priority time P1 3 P2 4 2 P3 P4 P5 35 P6 (a) Draw four Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: FCFS, SJF, preemptive priority (a smaller priority number implies a higher priority), and RR (quantum-5) (b) What is the waiting time and turnaround time of each process for each of the scheduling algorithms in part (a)? Show transcribed image text Question 1 [Points 10] Consider the following set of six processes, with the arrival times, CPU burst time (in milliseconds), and priority. Process |Arrival Burst time |Priority time P1 3 P2 4 2 P3 P4 P5 35 P6 (a) Draw four Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: FCFS, SJF, preemptive priority (a smaller priority number implies a higher priority), and RR (quantum-5) (b) What is the waiting time and turnaround time of each process for each of the scheduling algorithms in part (a)?