Consider a multi$-$level feedback queue, which has the following $4$ queues in the highest to

lowest priority order:

Q$1($highest priority$)$ has a time$-$slice of $4$ seconds,

Q$2$ has a time$-$slice of $6$ seconds,

Q$3$ has a time$-$slice of $8$ seconds, and finally

Q$4($lowest priority$)$ has a time$-$slice of $15$ seconds.

Assume the following:

The MLFQ has been implemented without any priority boost.

Context switching is instantaneous.

Round$-$Robin is implemented in the lowest$-$priority queue.

A process does not run any longer than the allotted time$-$slice in Q$1$ or Q$2$ or Q$3$ on

aggregate.

Processes are scheduled in arrival order within a queue.

Consider three jobs A$,$ B$,$ and C$,$ with running times of $40$ seconds, $50$ seconds, and $18$

seconds respectively. A arrives first, immediately followed by B$,$ and then C arrives $30$

seconds later.

For each process, state the start time, end time, and the queue it runs in$.$

For example, answer for A can look like: $[5,7,$Q$1]$; $[13,15,$Q$2]$; $[27,31,$Q$3]$; $[67,73,$Q$4]$; and

$93,99,Q4$