A$=32,$B$=2048,$C$=5,$D$=5,$E$=20,$F$=3,$G$=15$

$($Multilevel Feedback Queue$)$ In an MLFQ scheduler, we have $D$ queues and two jobs; $P$ and $Q.$ Each job

lasts $E$ seconds. Job $P$ arrives $2$ seconds after Job Q$.$ Job $P$ always performs $\frac{\text{I}}{O}$ after running $0\mathrm{.}1$ seconds

on CPU and the I$/$O always takes $0\mathrm{.}9$ seconds. Job $Q$ does not perform any I$/$O$.$ The time slice is $F$ seconds

$($in all levels$)$ and the boost time is $G$ seconds. Context switch time is ignorable. There is only one CPU.

Show and explain how the jobs given above are scheduled $(30$ points$).$

Without any graphics, you can simply show scheduling information as follows