Q$2.$ The following processes are being scheduled using a preemptive, priority$-$based, round$-$robin scheduling

algorithm.

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

addition to the processes listed above, the system also has an idle task $($which consumes no CPU resources and

is identified as $P_{\text{i}\text{d}\text{l}\text{e}}).$ This task has priority $0$ and is scheduled whenever the system has no other available

processes to run. 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$.$ 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?

d$.$ What is the CPU utilization rate?