Question & Consider the shortest Job First (SJF) Scheduling Algorithm with the following data Process Execution time Arrival time P 5 1 P2 4 3 P 6 0 PA 3 PS 7 4 1. Is this Algorithm preemptive or non-preemptive? 2 2. Illustrate the Gantt chart 0 3. Calculate the waiting time of each process 4. Calculate the average waiting time Question 9: Consider the Round Robin Scheduling Algorithm and Quantum Q=4 with the following data Process Execution time Arrival time P 5 1 P: 4 3 P, 6 0 PA 3 2 Ps 7 4 1. Is this Algorithm preemptive or non-preemptive? 2. Illustrate the Gantt chart 0 3. Calculate the waiting time of each process 4. Calculate the average waiting time Question 10. Consider the Round Robin Scheduling Algorithm and Quantum Q= 3 with the following data Process Execution time Arrival time P S 1 P2 4 3 P, 6 0 PA 3 2 PS 7 4 1. Is this Algorithm preemptive or non-preemptive? 2./Allustrate the Gantt chart 0 3. Calculate the waiting time of each process 4. Calculate the average waiting time Question 12. Consider the Round Robin Scheduling Algorithm and Quantum Q-2 with the following data Process Execution time Arrival time P 5 1 P2 4 3 P 6 0 PA 3 2 PS 7 4 1. Is this Algorithm preemptive or non-preemptive? 2.Illustrate the Gantt chart 0 3. Calculate the waiting time of each process 4. Calculate the average waiting time Question 13: Consider the Round Robin Scheduling Algorithm and Quantum Q=1 with the following data Process Execution time Arrival time P 5 1 P 4 3 P. 6 0 PA 3 2 PS 7 1. Is this Algorithm preemptive or non-preemptive? 4 2. Illustrate the Gantt chart 10 3. Calculate the waiting time of each process I 4. Calculate the average waiting time