The following processes are being scheduled using a preemptive, 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 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.

thread priority burst arrival

p1 40 20 0

p2 30 25 25

p3 30 25 30

p4 35 15 60

p5 5 10 100

p6 10 10 105

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?