Question # $14[$s $71$ Consider the following set of processes, with the length of the CPU burst given in seconds: Process P$1$ P$2$ P$3$ P$4$ Burst time $10040503$ Arrival time $1234$ a$)$ Draw four Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: FCFS$,$ TN$15$ SJF preemptive and Round Robin $($quantum $=3).$ b$)$ What is the turnaround time of each process for each of the scheduling algorithms in part a$?$ c$)$ What is the waiting time of each process for each of these scheduling algorithms? d$)$ Which of the algorithms results in the minimum average waiting time over all processes$)?$ e$)$ Which of the algorithms results in the minimum average turnaround time $($over all processes$)?$