$\backslash$table$[[$Process$,$Burst Time,Priority$],[$P$1,10,3],[$P$2,1,1],[$P$3,2,3],[$P$4,1,4],[$P$5,5,2]]$

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

i$.$ Draw four Gantt charts 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 $=1).$

$10$ Marks

ii$.$ What is the turnaround time of each process for each of the scheduling algorithms in part i$?$

$5$ Marks

iii. What is the waiting time of each process for each of these scheduling algorithins?

$5$ Marks

iv$.$ Which of the algorithms results in the minimum average waiting time $($over all processes$)?$

$5$ Marks