The following processes exist in a system, and at a given snapshot of time this is how they come in:

Process:ArrivalTime:BurstTime:Priority

P$1$:$0$:$8$:$1$

P$2$:$4$:$3$:$3$

P$3$:$10$:$1$:$2$

P$4$:$12$:$10$:$4$

Draw Gantt Charts and calculate the average wait times for each of the following scheduling schemes

a$)$ First Come First Serve $($Assume all arrival times to be $0$ and the order to be P$1,$ P$2,$ P$3,$ P$4)$

b$)$ Shortest Job First $($Assume all arrival times to be $0$ and the order to be P$1,$ P$2,$ P$3,$ P$4)$

c$)$ Shortest Remaining Time First

d$)$ Round Robin $($with time quantum $2)$

e$)$ Priority Based

Remember to consider for each scheme whether it is preemptive or non$-$preemptive.