The following processes are being scheduled using a pre$-$emptive, priority$-$

based, round$-$robin scheduling algorithm.

Each process is assigned a numerical priority, with a higher number indicating a

higher relative priority. The scheduler will execute the highest priority process. For

processes with the same priority, a round$-$robin scheduler will be used with a time

quantum of $10$ units. If a process is pre$-$empted by a higher$-$priority process, the

pre$-$empted process is placed at the end of the queue.

a$.$ Show the scheduling order of the processes using a Gantt chart.

b$.$ What is the turnaround time for each process?

c$.$ What is the waiting time for each process?