Let six processes P$1,$ P$2,$ P$3,$ P$4,$ P$5$ and P$6$ have the following arrival times and CPU bursts:

ProcessArrival TimeCPU BurstP$1$t$8$P$2$t$+31$P$3$t$+63$P$4$t$+85$P$5$t$+126$P$6$t$+153$

Assume that no other activity is present $($i$.$e$.,$ the CPU is idle and the ready queue is empty$)$ when process P$1$ arrives at time t$.$

In a Round Robin CPU scheduler with a time quantum of $2$ units, determine the schedule of process execution for the above six processes. Which of the following is a FALSE statement about the execution order for the processes?

Question $1$ options:

P$3$ starts after P$1$ finishes

P$1$ finishes before P$3$ finishes

P$5$ finishes after P$6$ finishes

P$1$ finishes before P$4$ starts