1- Consider the following set of processes, with the length of the CPU-burst time given in milliseconds: Process P1 P2 P3 P4 P5 Burst Time 2 1 4 5 8 Priority 2 1 3 2 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 non-preemptive priority (a smaller priority number implies a higher priority), and RR (quantum= 2) scheduling. b) What is the turnaround time of each process for each of the scheduling algorithms in part a? c) What is the waiting time of each process for each of the scheduling algorithms in part a? d) Which of the schedules in part a results in the minimal average waiting time (overall processes)