Consider a system which is using a multilevel feedback queue CPU scheduling algorithm with three queues, numbered as Q

$1$

$,$

Q

$2$

$,$

$$and Q

$3.$

$$The scheduler first executes processes in Q

$1$

$,$

$$which is given a time quantum of

$8$

$$ms

$.$

$$If a process does not finish within this time, it is moved to the tail of the Q

$2.$

$$The scheduler executes processes in Q

$2$

$$only when Q

$1$

$$is empty. The queue Q

$2$

$$is given a time quantum of

$16$

$$ms

$.$

$$if a process does not finish within this time, it is moved to the tail of the Q

$3.$

$$processes in Q

$3$

$$are run on an FCFS basis, only when Q

$1$

$$and Q

$2$

$$are empty. A process that arrives in Q

$1$

$$will preempt a process in Q

$2$

$$and Q

$3$

$,$

$$and a process that arrives in Q

$2$

$$will preempt a process in Q

$3.$

$$

Draw and describe a Gantt chart to show the order of execution for the following set of processes with their CPU

$-$

burst and arrival time.

Process Arrival Time CPU

$-$

burst

$($

ms

$)$

P

$1$

$0$

$17$

P

$2$

$10$

$25$

P

$3$

$15$

$8$

P

$4$

$20$

$32$