Consider the following set of processes, with the length of the CPU burst and I/O burst given in milliseconds: Process CPU, I/O, CPU Arrival time P1 2, 3, 1 0 P2 2, 1, 4 4 P3 1, 1, 4 10 P4 6, 6, 6 13 For example: In FCFS a process p1 arrived at 0 ms gets CPU for 2 ms, then releases CPU to the next process for 3ms where it performs I/O burst and return back to the queue with a new arrival time as (2+3 = 5ms) 5 ms. In case of a tie, go with process number. Perform the following for FCFS and non-preemptive SJF scheduling algorithm: Calculate the average waiting time, average turnaround time. With respect to each metric justify which scheduling algorithm is good for the given process mix.

Question

Consider the following set of processes, with the length of the CPU burst and I/O burst given in milliseconds:

Process	CPU, I/O, CPU	Arrival time
P1	2, 3, 1	0
P2	2, 1, 4	4
P3	1, 1, 4	10
P4	6, 6, 6	13

For example: In FCFS a process p1 arrived at 0 ms gets CPU for 2 ms, then releases CPU to the next process for 3ms where it performs I/O burst and return back to the queue with a new arrival time as (2+3 = 5ms) 5 ms.

In case of a tie, go with process number. Perform the following for FCFS and non-preemptive SJF scheduling algorithm:

Calculate the average waiting time, average turnaround time.
With respect to each metric justify which scheduling algorithm is good for the given process mix.