PART $3$:

A$)$ Provide the Gantt chart and Average Waiting Time of the following using

$(7+3)$

Shortest Job First algorithm for both preemptive and non$-$preemptive scheduling:

$\backslash$table$[[$Processes$,$Arrival Time,Burst Time$],[P_1,0,7],[P_2,2,5],[P_3,4,1],[P_4,5,4],[P_5,7,2]]$

B$)$ Provide Gantt chart and Average Waiting Time for the set of processes in $(3$A$)$ using Round Robin Algorithm for Time Quantum $=3.$