The following processes are being scheduled using a preemptive, priority-based, round-robin scheduling algorithm. Each p

[answerhappygod]

The following processes are being scheduled using a preemptive,priority-based, round-robin scheduling algorithm.
Each process is assigned a numerical priority, with a highernumber indicating a higher relative priority. The scheduler willexecute the highest-priority process. For processes with the samepriority, a round-robin scheduler will be used with a time quantumof 5 units. If a process is preempted by a higher-priority process,the preempted process is placed at the end of the queue. You mustshow your work in each part.
What is the turnaround time for each process?
What is the waiting time for each process?
What is the CPU utilization?