b Below is a set of processes with CPU burst times listed in milliseconds. Assume all processes arrive at time 0 in the order shown. Process CPU burst 10 ms B 3 ms 6 ms 8 ms 5 ms a) Create a Gantt chart for the shortest Job First scheduling algorithm. Assume no preemption. Label the ending times of each process. Use this format for your Gantt chart: | W | X | Y | Z | 4. 7 10 17 b) What are the wait times for each process, and the average wait time for SjF? Show your work. C) Draw a Gantt chart for the Round Robin scheduling algorithm. Use a quantum of 5 ms. d) What are the wait times for each process, and the average wait time for Round-Robin? Show your work. 0