Assignment $(1)$: CPU Scheduling

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

The processes are assumed to arrive all in order $P_1,P_2,P_3,P_4,P_5,$ all at time $0.$

a$.$ Draw four Grantt charts that illustrate the execution of these processes using FCFS$,$ SJF$,$ a

nonpreemptive priority $($smaller priority number implies a higher priority$),$ and $RR$

$($quantum $=1).$

b$.$ For each scheduling algorithm in part $($a$)$; what is the turn around time for each process?

c$.$ For each scheduling algorithm in part $($a$)$; what is the waiting time for each process?

d$.$ Which one of the scheduling algorithms in part $($a$)$ results the minimal average waiting

time $($over all processes$)?$