Part $2-$ Multi Level Feedback Queue

Suppose that you have a single processor multi$-$level$-$feedback$-$queue as described in Chapters $8\mathrm{.}1$ and $8\mathrm{.}2.($Do not add the later extra rules.$)$ There are three queues with scheduling quanta of $5,10,$ and $20$ time units. Each context switch takes one time unit. $($This includes when a single job changes queues but continues to execute.$)$ Ties are broken in favor of the job that arrived earlier.

Consider the following three jobs:

Job A wants to run continuously for $25$ time units starting at time $0.$

Starting at time $5,$ Job B wants to run for $1$ time unit, then block for $11$ time units, repeating three times.

Starting at time $18,$ Job C wants to run continuously for $10$ time units

Question $4$: Carefully diagram how the basic MLFQ scheduler would schedule these jobs until all are complete, including the times of each significant event in the schedule.