Consider a Shortest Job First $($SJF$)$ CPU scheduler, with the following process workload:

ProcessArrival TimeCPU BurstP$1$t$4$P$2$t$+26$P$3$t$+31$P$4$t$+62$P$5$t$+77$P$6$t$+93$

Assume that the CPU is idle and there are no other processes in the ready queue when P$1$ enters the ready queue at time t$.$ Determine the schedule of process execution, and compute the wait times and turnaround times for each of the six processes. Which of the following is a FALSE statement about the wait times and turnaround times of the processes?

Question $2$ options:

P$5$ has a larger turnaround time than P$4$

P$6$ has a larger turnaround time than P$4$

P$5$ has the largest wait time

P$6$ has a smaller turnaround time than P$2$