Suppose you have the following processes: Arrival Time 0 Process P1 P2 P3 P4 P5 Burst Time 14 10 2 7 13 3 5 7 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. quantum - 4 quantum - 6 FCFS 1. Draw the Gantt Chart for Queue 2. 2. Find the total waiting time for process P2. Hint 1: Once a process executed using 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