Assume that the ready queue has just received four processes: P$1,$ P$2,$ P$3,$ P$4,$ in that order. All at time $0.$ The CPU execution times for these processes are as follows:

Process Execution Time

P$112$

P$219$

P$37$

P$418$

Draw the Gantt chart and calculate the metric listed in parentheses for each of the following scheduling algorithms:

First Come, First Served $($Total Wait Time$)$

Shortest Job First $($Total Wait Time$)$

Round Robin, with a quantum of $6$ms $($Total Wait and Response Times$)$