2) Consider two CPU scheduling algorithms for a single CPU: Preemptive Shortest-Job- First (also known as Shortest Remaining Time First) and Round-Robin. Assume that no time is lost during context switching. Given four processes with arrival times and expected CPU time as listed below, draw a Gantt chart to show when each process executes using a) Round-Robin with a time quantum of 4. b) Preemptive Shortest-Job-First (Shortest Remaining Time First). For part b) only, calculate the average turnaround time. Process P1 Arrival Time 0 3 5 P2 Expected CPU Time 7 9 6 3 P3 P4