Consider two processes, each with two CPU bursts with one I/O burst in between Process 1 has a CPU burst of 9 units followed by an I/O burst of 7 units and a CPU burst of 6 unit Process 2 has a CPU burst of 2 units followed by an I/O burst of 1 units and a CPU burst of 5 units Suppose that Process 1 arrives in the ready queue just before Process 2 and just after Process 2 arrives the process that was in the CPU terminates. No other processes are in the system. For each of the scheduling algorithms below create Gantt charts like you did for assignment 2. Fill each box with the state of the corresponding process. Use R for running, W for waiting, and r for ready. Calculate the waiting times and CPU utilization (as a fraction) for each process and fill in the table below a) First-Come/First-Served b) Shortest Job First (non-preemptive) c) Preemptive Shortest Job First d) Round Robin with a quantum of 3 Gantt Charts: 10 15 20 25 a) FCFS Process Process 2 b) SJF Process Process 2 c) PSJF Process 1 Process 2 d) RR 3 Process 1 Process 2 10 15 20 25 30 10 15 20 25 30 10 15 20 25 aiting Time me Finis AlgorithmU a) FCFS b) SJF c) PSJF d) RR 3 Utilization Process1 Process 2 Average Process1 Process 2