Question One ( 3 Marks 1 Consider the following set of processes, with the length of the CPU burst time Process Arrival time Burst time P1 0 30 P2 5 20 P3 P4 P5 10 10 70 70 40 30 a) Draw four Gantt charts that illustrate the execution of these processes using the following scheduling algorithms • First-Come, First-Served (FCFS) Scheduling ⚫ Shortest-Job-First (SJF) Scheduling ⚫ RR (quantum = 10) • Multiple level with 3 Queues: Q1: RR with quantum 10 。 Q2: RR with quantum 20 • Q3: FCFS b) What is the turnaround time and response time of each process for each of the scheduling algorithms in part a? c) Calculate the average waiting time for the first three algorithms

Fig: 1