Consider a preemptive priority$-$based CPU scheduler. Each time a process enters the ready queue, the running process is preempted if its priority is lower than that of the newly entering process.

ProcessPriorityArrival TimeCPU BurstP$13$t$5$P$24$t$+23$P$35$t$+49$P$41$t$+61$P$52$t$+87$P$66$t$+103$

Assume that larger numbers mean higher priority. For example, P$3$ has higher priority than P$2.$ Determine the schedule of process execution. Which of the following is FALSE about the execution order for the processes?

Question $1$ options:

P$6$ starts after P$3$ starts

P$6$ starts before P$1$ finishes

P$4$ starts before P$6$ starts

P$6$ finishes before P$5$ starts