Consider a priority$-$based CPU scheduler. Assume that no process preemption is

allowed $($that is$,$ once a process gets the CPU it is executed until all of its CPU burst

is done$).$ Let the process workload for this scheduler be as follows:

Assume that when process P $1$ arrives at time t $,$ the CPU is idle and there are no

other processes in the ready queue. Assume also that larger numbers mean higher

priority. For example, P$3$ has higher priority than P$2.$

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?

a$.$ P$6$ has a smaller turnaround time than P$3$

b$.$ P$1$ has the smallest turnaround time

c$.$ P$4$ has the largest turnaround time

d$.$ P$6$ has the largest turnaround time