- (20 pts Total) Scheduling a. Below is a set of processes with CPU burst times listed in milliseconds. Process 1 2 3 4 5 Arrival Time 0 5 2 6 1 CPU burst 10ms 5ms 2ms 8ms 12ms a. (8 pts) Draw a Gantt chart for the shortest Remaining Time First scheduling algorithm. Label the ending times of each process. b. (8 pts) Draw a Gantt chart for the Round Robin scheduling algorithm. Assume round robin ordering starts with Process 1. Use a time quantum of 4ms. Label the ending times of each process. c. (4 pts) For Round Robin in part b) above, what is the average wait time? What is the turnaround time