(Solved): 1- Apply the Preemptive and Non-Preemptive Shortest-Job-First (SJF) Scheduling to find Average wait ...

1- Apply the Preemptive and Non-Preemptive Shortest-Job-First (SJF) Scheduling to find Average waiting time and draw the SJF scheduling chart. Burst time Arrival time Process Queue P1 6 2 P2 2 5 P3 8 1 P4 3 0 P5 4 4 2- Apply the Non-Preemptive priority scheduling to find Average waiting time and draw the priority scheduling chart. Process Queue Burst time Priority P1 10 3 P2 1 1 P3 2 4 P4 1 5 P5 5 52