(2) (16 points) Given the arrival time and CPU-burst of 5 processes shown in the following diagram 41 Process Arrival Time (ms) Brst Ti 0 18 2 10 21 30 P2 P3 P4 P5 P6 25 10 42 35 12 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 these two queues is different. SJF scheduling strategy is used for the queue with the lowest priority. The scheduling is non-preemptive. Quantum 4 Quantum 8 Shortest-Job-First a) (10 points) Construct a Gantt chart depicting the schedule for the set of processes specified in the above diagram using this 3-level feedback queue. b) (6 points) Calculate the average waiting time for the schedule constructed in a)