The following processes have 4 CPU burst and 3 I/O bursts each. They are all of the same priority and they arrive in the order P1, P2, P3 at time 0.

	CPU	I/O	CPU	I/O	CPU	I/O	CPU
P1	10	10	10	10	10	10	10
P2	5	5	5	5	5	5	5
P3	5	10	5	10	5	10	5

a. Draw three Gantt charts illustrating the execution of these processes using FCFS, SJF, and RR (quantum = 1t) scheduling.

b. What is the turnaround time of each process for each of the scheduling algorithms in part (a)?

Anyone can explain how does it work? (need process)

Thanks!