I don't know how to "Show the activity in the processor and the I/O area" As well as I can compute the average waiting time but I'm not sure how to do response time and throughput.

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 O. 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 CPU Burst IO Burst CPU Burst Time 2 2 2 IO Burst Time 2 CPU Burst Time 4 Time Time P1 P2 P3 4 2 2 2 2 Each process exits the system once its CPU and I/O bursts as shown above are complete Show the activity in the processor and the L/O area using the FCFS, SJF, and Round Robin (time quantum = 2) algorithms For each algorithm, compute the average waiting time, the average response time and the throughput