Three processes with the following arrival time and CPU time, a. Please draw the Gantt chart to illustrate the CPU scheduling for FIFO, Short Job First (SJF), Shortest Remaining Time first (SRT), and Round Robin (Quanturn is 4) algorithm. Note that the Gantt chart for FIFO is already given as example using the insert table function here. No need to draw FIFO. b. Also Compute the turn around time for each of the process under FIFO, Short Job First (SJF), Shortest Remaining Time first (SRT), and Round Robin algorithm. Note that SRT is the preemptive version of SJF. Fill the given table Process p1 p2 p3 Arrival time 0 1 3 Total CPU time 8 5 2 Gantt chart for FIFO: P1 P2 P3 0 8 13 15 Compute the turn around time for each of the processes under each of the three scheduling algorithm ( you may create a table in your answer or just list your answers): Process p1 p2 p3 FIFO: Turnaround times SJE: Turnaround times SRT: Turnaround times RR: Turnaround times