Consider the following set of processes, with the length of the CPU burst time given in milliseconds: (15 points)

Process Burst Time Priority

P1 11 3

P2 5 1

P3 3 2

P4 6 4

The processes are assumed to have arrived in the order P1, P2, P3, P4, all at time 0.

Draw four Gantt charts (you can just list each process with start and stop times in correct orders) that illustrate the execution of these processes using the following scheduling algorithms: FCFS, SJF, non-preemptive priority (a smaller priority number implies a higher priority), and RR (quantum = 3).

FCFS:

SJF:

Non-preemptive priority:

RR:

What is the turnaround time of each process for each of the scheduling algorithms in part a? What is the average turnaround time for each scheduling algorithm? Show your calculations.

What is the waiting time of each process for each of these scheduling algorithms? Show your calculations.

Which scheduling algorithm has the minimum average turnaround time? Show your calculations.

Which scheduling algorithm has the minimum average waiting time? Show your calculations.