There are three processes in the scheduling queue and assume that all three of them are ready to run. Assume that P1 arrived a little before P2; and P2 arrived a little before P3. Scheduling starts at time t = 0. The CPU and I/O burst patterns of the three processes are as shown below:

Given the following processes that arrived in the order shown.

Each process exits the system once its CPU and I/O bursts as shown are complete.

1) Show the activity in the processor and the I/O area using the FCFS, SJF, and Round Robin (time quantum = 2) algorithms.

2) For each algorithm, compute the average waiting time, the average response time, and the throughput.

CPU Burst IO BurstCPU BurstIO Burst CPU Burst Time 2 2 2 Time Time Time Time P1 P2 P3 4 2 4 2 2 2 2