Please, answer all the parts or let somebody else answer this question. I will give you a thumbs up. Thank you

2) The following processes are being scheduled using a preemptive, roundrobin scheduling algorithm. Each process is assigned a numerical priority, with a higher number indicating a higher relative 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 I task has priority 0 and is scheduled whenever the system has no other available processes to run. The length of a time quantum is 5 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? 2 Thread 1 Priority Burst 20 Arrival 20 20 10 30 P4 P5 P6 15 30 15 10 90 105 10