.. Suppose you have the following processes: Process Arrival Time P1 0 P2 1 P3 3 P4 5 PS 7 Burst Time 13 10 2 7 13 Use the following multilevel feedback queue CPU scheduling algorithm to execute the above processes: Queue 1: using RR CPU scheduling algorithm with Q = 4 ms, Queue 2: using RR CPU scheduling algorithm with Q = 6 ms, and Queue 3: using FCFS CPU scheduling algorithm quarum - 4 - 6 FCFS 1. Draw the Gantt Chart for Queue 2. 2. Find the total waiting time for process P2. Hint: Once a process executed from one queue it should go direct to start execution in the next queue if this queue is free. Hint 2: The starting time is 0 for Queue 1 only and it is different in all remaining queues. Use the editor to format your