For each scheduling algorithm $($FCFS$,$ SJF$,$ Priority, and RR$),$ calculate the following for each process:

Finish Time

Turnaround Time

Waiting Time

Draw a Gantt chart

Then, identify which process has the minimum waiting time. Time Quantum$=2.(8$ pts$.)$

Processes

$\backslash$table$[[$Process$,$Arrival Time,Burst Time,Priority$],[$P$1,0,5,3],[$P$2,2,3,1],[$P$3,4,1,4],[$P$4,6,7,2]]$