02. Using the shortest job first (SJF) scheduling algorithm (Non-preemptive): a) Draw the Gantt chart. b) Compite the waiting time for each process. c) Compute the average waiting time for all the processes d) Compute the turnaround time for each process e) Compute the average turnaround time for all processes. Course: Operating systems Instructor: Dr. Dara Agel First semester (2020-2021) Assignment 2 on FCFS and SJF (preemptive and non preemptive) algorithms Student name and number: Burst Time Arrival time Process P1 10 0 P2 2 2 Q3. Using the shortest job first (SJF) scheduling algorithm (Preemptive) a) Draw the Gantt chart b) Compute the waiting time for each process. 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. P 5 6 P4 4 6 P5 3 10 Use the above table to answer the questions below! Q1. Using the first come first serve (FCFS) algorithm a) 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