Problem 4 The processes in the table below are being scheduled using round-robin scheduling algorithm with preemption. Each process is has a numerical priority, with a higher number indicating a higher priority. In addition to the processes listed below, the system also has an idle task (which consumes no CPU resources and is identified as Pidle). 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 process is not preempted by a process with the same priority, unless the time slice expires. A process cannot be preempted by a lower priority process, even if the time slice expires.) a. Show the scheduling order of the processes using a Gantt chart for Robin Robin with Priority (preemptive) as specified above Answer the following only for Robin Robin with Priority (preemptive) b. What is the turnaround time for each process? c. What is the total waiting time for each process (including initial and in the Ready Queue)? d. What is the CPU utilization rate? Priorit 40 30 30 35 Arrival Burst 20 25 25 Thread P2 P3 P4 25 30 60 Answer: a) Gantt Charts If there is no preemption within a time quantum Robin Robin with Priority (preemptive) 0 10 20 25 35 45 65 75 80 85 90 b) Turnaround time: c) Waiting time: d) CPU util