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 I ). 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 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.

Thread P1 P2 P3 P4 P5 P6 Priority 20 30 20 35 5 15 Burst 30 20 10 25 5 10 Arrival 0 20 50 65 95 105