$5$

$12$ points

For the five processes in the above, we consider a MLFQ scheduling policy with simplification. We ignore priority boost and I$/$O and the detailed policy is as follows: A new job enters $Q_1$ in Round$-$Robin $($RR$).$ When it gains CPU, job receives $1$ time unit; If it does not finish in $1$ time unit, it is moved to $Q_2.$ At $Q_2,$ job is again served in $RR$ and receives $2$ time units. If it still does not complete, it is preempted and moved to $Q_3.$ Run $RR$ in $Q_3$ with quantum size $4.$

$[7$ points$]$ Draw the Gantt Chart

$[3$ points$]$ Determine the corresponding latency for each process:

$\backslash$table$[[$latency$,P_1|P_2||,P_3$ P$4,P_4{P}_5$