Given the arrival time and CPU-burst times of 6 processes shown in the following diagram: Process P1 P2 P3 P4 P5 P6 Arrival Time (ms) 0 Burst Time (ms) 16 12 2 7 15 20 Suppose the OS uses a 3-level feedback queue to schedule the above 6 processes. Round-Robin scheduling strategy is used for the queue with the highest priority and the queue with the second highest priority, but the time quantum used in hese two queues is different. First-come-first-serve scheduling strategy is used for the queue with the lowest priority. The scheduling is preemptive. (Note: In this scenario, the scheduling is preemptive, which means that the execution of the current job may be preempted by another job with higher priority. a newly arriving job can preempt a job currently running only if its priority is higher than this job) Quantum-4 Quantum-8 FCFS Construct a Gantt chart depicting the scheduling for the set of processes specified in the above diagram using this 3-level feedback queue, and compute the average waiting time for all processes (10 points) Given the arrival time and CPU-burst times of 6 processes shown in the following diagram: Process P1 P2 P3 P4 P5 P6 Arrival Time (ms) 0 Burst Time (ms) 16 12 2 7 15 20 Suppose the OS uses a 3-level feedback queue to schedule the above 6 processes. Round-Robin scheduling strategy is used for the queue with the highest priority and the queue with the second highest priority, but the time quantum used in hese two queues is different. First-come-first-serve scheduling strategy is used for the queue with the lowest priority. The scheduling is preemptive. (Note: In this scenario, the scheduling is preemptive, which means that the execution of the current job may be preempted by another job with higher priority. a newly arriving job can preempt a job currently running only if its priority is higher than this job) Quantum-4 Quantum-8 FCFS Construct a Gantt chart depicting the scheduling for the set of processes specified in the above diagram using this 3-level feedback queue, and compute the average waiting time for all processes (10 points)