$2.[1\mathrm{.}5$ pts$]$ Given the following information:

Process: A B C D E F

Arrival Time: $0246810$

CPU Burst: $364857$

Draw a Gantt chart that illustrate the execution of the given processes using FCFS$,$ SJF$,$ and

RR $($quantum $=2,$ ignoring context switching overhead$).$ Compute the average waiting time

and average turnaround time for each scheduling algorithm.