The following processes are being scheduled using a preemptive, round robin scheduling algorithm.

Process

Priority

$40$

Burst

Arrival

$0$

P$1$

$20$

P$2$

$30$

$25$

$25$

P$3$

$30$

$25$

$30$

P$4$

P$5$

$35$

$15$

$60$

$5$

$10$

$10$

$100$

P$6$

$10$

$105$

Each process is assigned a numerical priority, with a higher number indicating a higher relative priority. The length of a time quantum is $10$ units. If a process is preempted by a higher$-$priority process, the preempted process is placed at the end of the queue.

O a$.$ The turnaround time of P$5=120,$ the waiting time of P$3=25$

Ob$.$ The turnaround time of P$5100,$ the waiting time of P$3=30$

Oc The turnaround time of P$520,$ the waiting time of P$3-35$

Od$.$ The turnaround time of PS $=25,$ the waiting time of P$3=20$