4 3 Question 13: consider the shortest Remaining Time First (SRTF) with the following data Process Execution time Arrival time PA 5 1 P2 P 6 0 PA 3 2 PS 7 4 1. Is this Algorithm preemptive or non-preemptive? 2. Wustrate the Gantt chart 10 3. Calculate the waiting time of each process Question 14: Consider a non-preemptive version of PRIORITY scheduling algorithm with the following data Process Execution time Arrival time Priority P. 5 1 3 P2 4 3 1 P 6 0 4 3 2 5 PS 7 4 3 1. Illustrate the Gantt chart PA 10 2. Calculate the waiting time of each process 3. Calculate the average waiting time Question 15: Consider a preemptive version of PRIORITY scheduling algorithm with the following data Process Execution time Arrival time Priority P 5 1 3 Pa 3 1 P 0 4 P 3 5 . 7 4 3 1. Illustrate the Gantt chart 4 6 2 2. Calculate the waiting time of each process 3. Calculate the average waiting time 4. Calculate the average waiting time