Suppose that the following processes arrive for execution at time zero. Use Round Robin scheduling algorithm if the Quantum time (time slice=2). Assume that at time t=19 a new process P6 with burst time 9 enters the system, determine the order of execution of the ready Queue at t=20? Process P1 P2 P3 P4 P5 Burst Time 9 5 12 6 7 O a. P1, P2, P3, P4, P5, P6 O b. P5, P1, P3, P2, P4, PG O c. P6, P5, P1, P2, P3, P4 O d. P2, P3, P4, P5, P6 O e. P5, P1, P6, P2, P3, P4