Question 1: [Marks: 10] Imagine we have a multi-level feedback queue with 2 queues. The highest priority queue is a RR scheduler with a quantum of 2. The second priority queue runs as a FCFS queue, as shown in figure below. Processes start in the RR queue and are demoted to the FCFS queue if they exceed their quantum. Processes in the RR queue are always prioritized over the FCFS queue. Round Robin, Q = 2 FCFS Process 1 2 3 4 5 Arrival Time 0 3 4 9 10 CPU Burst 4 4 3 2 3 The table above shows a list of processes along with their arrival times and CPU burst times. Calculate the average waiting time by using the multi-level feedback queue and draw the Gantt chart. Note: A process can only be preempted if it exceeds its quantum