Consider the following set of processes.

$\backslash$table$[[$Process$,$Arrival Time $($ns$),$CPU $/$ Processing Time $($ns$),$Priority$],[$A$,0,3,5],[$B$,2,4,2],[$C$,3,2,4],[$D$,5,2,1($Highest Priority$)],[$E$,8,5,3]]$

Table $5$: List of processes.

You are required to draw a timeline Gantt chart for each of the following algorithms. Then, calculate the Average Waiting Time and Average Turnaround Time for each of the algorithms. $($Ignore context switching time and natural wait$).$

a$)$ First Come First Serve scheduling $($FCFS$)$

b$)$ Shortest Job First $($SJF$)$

c$)$ Priority Scheduling $($PS$)-$ Non$-$preemptive

d$)$ Priority Scheduling $($PS$)-$ Preemptive

e$)$ Shortest Remaining Time scheduling $($SRT$)$

f$)$ Round Robin scheduling $($RR$)($Assuming the quantum given is $3$ time slices.$)$