3. 03: Assume the following Process. Process Burst Time Priority Arrival Time P1 18 3 0 P2 4 1 1 P3 2 5 2 P4 6 4 3 P5 10 2 30 For the set of processes directly above, draw a Gantt chart for the SJF (Shortest Job First - Non-Preemptive) Scheduling Algorithm. With CS = 0. a) For the set of processes directly above, calculate the throughput for the SJF (Shortest Job First -Non-Preemptive) Scheduling Algorithm. b) For the set of processes directly above, calculate the turnaround time for the SJF (Shortest Job First-Non-Preemptive) Scheduling Algorithm. c) For the set of processes directly above, calculate the average turnaround time for the SJF (Shortest Job First Non-Preemptive) Scheduling Algorithm. d) For the set of processes directly above, calculate the waiting time for the SJF (Shortest Job First Non-Preemptive) Scheduling Algorithm. e) For the set of processes directly above, calculate the average waiting time for the SJF (Shortest Job First) Scheduling Algorithm. 1) What is the CPU Utilization for the system