For the processes listed below, draw a Gantt chart illustrating their execution using: (a) First-Come FirstServed (b) Shortest Job First (c) Shortest Remaining Time (d) Round Robin (quantum = 1) (e) Round Robin (quantum =2) Also calculate the turnaround time, wait time for the algorithms and average throughput for each of the algorithms. [5points] Process Arrival Time Processing Time A 0.000 4 B 0.003 7 C 0.009 3 D 1.001 2 E 1.002 3 F 3.001 2