(60 points) Consider the following set of processes, with estimated CPU burst times given in milliseconds, and lower priority numbers correspond to higher priority (1 is the highest). The processes are assumed to have arrived in the order P1, P2, P3, P4, PS, all at time 0. Process Burst Time Priority P1 10 3 P2 1 1 03 2 3 P4 1 4 PS 5 2 a. Draw four time charts that illustrate the execution of these processes using the following scheduling algorithms: non-preemptive SJF, non-preemptive priority, RR (quantum=1). and RR (quantum=2) (30 points) b. Calculate the waiting time of each process for each of the scheduling algorithms in part (a) above. Which algorithm performs best in terms of average waiting time (30 points)? C. (Bonus 30 points) Remembering that turnaround time for a process is the time required for that process to complete, ie, from submission time to completion calculate the turnaround time of each process for each of the scheduling algorithms in part (a) above. Please fill out the following table to denote your answers to sections (b), and (c) above. RR (451) RR (q=2) N-Pr-SJE Waiting Turnaround N-Pr-Priority Waiting Turnaround Waiting Turnaround Waiting Turnaround P1 1 . 1 1 P2 1 1 . P3 1 . 1 1 24 P5 1 1 1 1