Question 4: CPU Scheduling 1) Suppose that processes P1, P2,...,P5 arrive for execution at the times indicated in Table 1. Each process will run for the amount of time listed, and will be assigned a priority ranging from 0 (highest) to 10 (lowest). No more processes will arrive until the last process completes. In answering the questions, base all decisions on the information you have at the time the decision must be made. Table 1: Process arrival/CPU-burst times and priorities. Process P Arrival Time Burst Time Priority 0.0 8 10 P₁₂ 0.4 4 2 P 0.5 1 10 PA P 0.8 2 1.0 2 1 5 a) Draw four Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: [12 marks] 1) FCFS; ii) preemptive SJF; iii) preemptive priority (SJF if priority is equal); iv) RR (quantum=2). I b) What is the turnaround time of each process for each of these four scheduling algorithms? [5 marks] c) What is the waiting time of each process for each of these four scheduling algorithms? [5 marks] d) Which of the algorithms results in the maximum overall turnaround time (over all processes)? [3 marks]