6.16 Consider the following set of processes, with the length of the CPU burst given in milliseco ndS: Process Burst Time Priority P3 4 2 4. P5 The processes are assumed to have arrived in the order Pi, P2, P3, P4, P5, all at time 0 a. Draw four Gantt charts thatillustrate the execution of these processes using the following scheduling algorithms: FCFS, SJF, nonpreemptive priority (a larger priority number implies a higher priority), and RR (quantum 2) b. What isthe turnaround time of each process for each of the scheduling algorithms in part a? What is the waiting time of each process for each of these schedul- ing algorithms? Which of the algorithms results in the minimum average waiting time (over all processes)? c. d