Q2. Using the shortest job first (SJF) scheduling algorithm (Non-preemptive) a) Draw the Gantt chart. b) Compute the waiting time for each process d Compute the average waiting time for all the processes d) Compute the turnaround time for each procen .) Compute the average turnaround time for all processes Courses Operating systems Instructor: Dr. Dara Agel First mester (2020-2021) Assignment 2 on FCPS and SJF (preemptore and non preemptive) sporithm Staduate and sumber Proces P: Burst Time 10 Arrival time O P 2 2 1. Using the shortest job thru (JF) scheduling algorithm (Preemptive .) Draw the Gantt chart. b) Compute the waiting time for each process. c) Compute the average waiting time for all the processes d) Compute the turnaround time for each process Compute the average turnaround time for all processes 5 P P4 PS 10