Consider below table of four processes under Multi-level queue scheduling. Queue number denotes the queue of the process. Note that priority of queue 1 is greater than queue 2. P1 P2 P3 P4 P5 P6 Arrival time 0 2 0 23 0 0 Burst time 7 5 8 4 b- Calculate the waiting time for each process c- Calculate the average waiting time 4 4 Queue 1 2 1 1 2 1 a- Draw a Gantt chart to illustrate how these processes would be scheduled if Queue 1 uses Round Robin (Time Quantum-7) and Queue 2 uses FCFS. Note that a task with the highest priority can interrupt the execution of task with a lower priority.