Consider the following set of processes, with the length of the CPU burst given in milliseconds:

Process	Burst Time	Priority
P1	5	4
P2	8	2
P3	3	5
P4	12	3
P5	9	6

The processes are assumed to have arrived in the order P1 through P5 all at time 0.

Draw four GANTT charts that illustrate the execution of these processes using the following scheduling algorithms, all of which are assumed to be non-preemptive:

FCFS

SJF

Priority-based (a larger priority number implies a higher priority)

RR (quantum = 2)

What is the turnaround time for each process for each of the scheduling algorithms in part a?

What is the waiting time for each process for each of those scheduling algorithms?

Which one of those scheduling algorithms results in the minimum average waiting time (over all processes)?