$(60\%)$ Consider the following set of processes, with the length of the CPU burst

given in milliseconds:

The processes are assumed to have arrived in the order P$1,$ P$2,$ P$3,$ P$4,$ P$5,$ all at

time $0.$

a$.(30\%)$ Draw four Gantt charts that illustrate the execution of these

processes using the following scheduling algorithms: FCFS$,$ SJF$,$ non$-$

preemptive priority $($a larger priority number implies a higher priority$),$ and

$RR($quantum $=2,$ no priority$).$

b$.(12\%)$ What is the turnaround time of each process for each of the

scheduling algorithms in part a$?$

c$.(12\%)$ What is the waiting time of each process for each of these scheduling

algorithms?

d$.(6\%)$ Which of the algorithms results in the minimum average waiting time

$($overall processes$)?$