consider the following set of processes with the length of the cpu - burst time given in milliseconds

Worksheet 02/02/2018 CPU scheduling Cpu scheduling is the basis of multi questions are about CPU scheduling Consider the following set of processes with the length of the CPU-burst time given in mmed operating systems. By switching the CPL the operating system can make the computer more productive. wing milliseconds: ProcessBurst Time Priority P1 P2 P3 P4 P5 10 The processes are assumed to have arrived in the order P1, P2, P3, P4, P5, all at time 0 Draw four Gantt charts illustrating the execution of these processes using FCFS, SJF, a non-preemptive priority (a smaller priority number implies a higher priority), and RR (quantum = 1) scheduling. a. What is the turnaround time of each process for each of the scheduling algorithms in part a? b. What is the waiting time (turnaround time minus burst time) of each process for each of the scheduling algorithms in part a? c. Which of the schedules in part a results in the minimal average waiting time (over all processes)? d