Hello, I need help with the question above? Can anyone assist me? I need help with FCFS, SJR and Round Robin.

If you can show your steps, it will help me understand better.

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