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

algorithm.

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.

a$.$ The turnaround time of $P5=100,$ the waiting time of $P3=30$

b$.$ The turnaround time of $P5=120,$ the waiting time of $P3=25$

c$.$ The turnaround time of $P5=25,$ the waiting time of $P3=20$

d$.$ The turnaround time of $P5=20,$ the waiting time of $P3=35$