The following processes are submitted to an operating system. They are calculation processes which require no input/output (i.e. they are always ready to utilize the CPU). Obtain the Gantt chart for Round Robin scheduling with quantum of 2 then select which process is running in each time slot. Note that when a process finishes it time quantum and another process arrives at the same time, the new process gets in the ready queue first. Process Arrival time Burst time P1 o 3 P2 1 4 P3 2 3 4 1 P4 0-1 [Choose) P2 Idle P3 P4 P1 1-2 2-3 [Choose] 3-4 [Choose ] a 4-5 [Choose ] a 5-6 [Choose ] 6-7 [ Choose ] 7-8 [Choose ] 8-9 [Choose ] 9-10 [Choose ) 10-11 [ Choose ] 4