Consider the following set of processes, with arrival time and execution time reported Priority(P)> Priority(P):
Process Priority Arrival Time Execution time
P₀ 5 0 4
P₁ 0 1 1
P₂ 3 2 8
P₃ 1 3 5
P₄ 2 4 3
P₅ 4 5 9
Calculate the average turnaround time for the following scheduling algorithms. Assume a scheduling quantum of 1 millisecond. Also draw a timeline (called a Gantt Chart) illustrating the schedule i. Priority Scheduling (processes are scheduled in the priority order)
