5) Consider the following set of processes, with the length of the CPU burst given in milliseconds Arrival Time Process P1 P2 P3 P4 P5 CPU Burst Time Priority 2 4 2 10 6 10 2 1) Draw six Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: FCFS, SJF, RR (quantum 1), RR priority), and non-preemptive priority (a smaller priority number implies a higher priority). 2) What is the turnaround time of each process for each of the scheduling algorithm in part (a)? What is the waiting time of each process for each of the scheduling algorithms in part (a)