Assume that context switch overhead is $0.$

When a process arrives, it is immediately eligible for scheduling, e$.$g$.,$ process $2$ that arrives at time $2$ can be scheduled during time unit $2.$

inserted first, and process $2$ second in the ready queue.

For each scheduling algorithm, draw the Gantt charts depicting the sequence of the process execution, and calculate the average turnaround time and average waiting time.

$($continue your answers for Q$3\mathrm{.}1)$

$(2)(20$ points$)$ Multi$-$Level Feedback Queue

Draw Gantt charts for a MLFQ scheduling and compute the average turnaround time and the average waiting time. The three queues are defined as follows.

Q $0$ : RR with time quantum $4$

Q$1$: RR with time quantum $8$

Q$2$: FCFS