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.$

$-$ Draw the Gantt Chart

$-$ Determine the corresponding latency for each process:

$-$ In the following, we consider the context switches, which were ignored in the above. We assume that each context switch takes $0\mathrm{.}2$

time units $($please ignore the switches between the same process$).$ What is the CPU utilization in completing all five processes $($keep three

decimal values$)?$