solve this question about operating systems. thank you

The following table shows the arrival time and CPU burst time of five processes: Process P1 P2 P3 P4 P5 Arrival Time (ms) 0 3 6 14 18 Burst Time (ms) 8 2 15 6 15 Assume that the above 5 processes are scheduled to run by using a three-level feedback queue. The Round-Robin scheduling algorithm is used for the highest priority queue as well as the second highest priority queue. However the time quantum used in these two queues is different. The First-come-first served scheduling algorithm is used for the lowest priority queue. See the diagram below. The scheduling algorithm is preemptive. Quantum = 4 Quantum = 8 FCFS Calculate the average waiting time for the schedule. (show your calculation steps) Calculate the average turnaround time for the schedule. (Show your calculation steps)