Show steps please

CPU Scheduling Practice Assume that there are three processes P1, P2, and P3 respectively submitted at times 2, 3, and 9. The CPU scheduler is invoked the first time at time 3 after completing a previous process (other than P1, P2, or P3). The three processes P1, P2, and P3 require respectively 12, 5, and 7 units of time. We assume that 1) the CPU scheduler allows preemption; 2) context switch takes one time unit when a process is preempted by another process; 3) no context switch if a process terminates normally; and 4) the context switch is negligible if a process is just loaded, not preempted. Hint: the waiting time of each process can be calculated using the following equation waiting time = completion time-execution time-arrival time Draw the Gantt Chart and compute the Average Waiting Time (AWT) if the CPU scheduler uses a Multi-Level Feedback Queue with three queues having respectively the following quantum: 3, 5, and 10. You can assume that all processes will be initially added to the queue (at the top level) with quanta-3 and will be pushed down to the queue with quanta-5 and quanta-10 thereafter