b. [8 points] Suppose we have a system using multilevel queuing. Specifically there are two queues and each queue has its own scheduling algorithm: QueueA uses RR with quantum 3 while QueueB uses FCFS. CPU simply gets processes form these two queues in a weighted round robin manner with 2:1 ratio (i.e. it gets two processes from QueueA then gets one process from QueueB, and then gets two processes from QueueA then gets one process from QueueB, and so on), But when it gets a process from Queue A, it applies RR scheduling with quantum 3. When it gets a process from QueueB, it applies FCFS scheduling. Draw the Gantt charts (5pt) and compute waiting times (3pt) for the following four processes: P1, P2, P3, P4 on a single core CPU. Assum CPU burst time of 5 units. There is no other processes or IO bursts. e these processes arrived at the same time and in that order. Each process has a single ratio 10 15 20 QueueAP1 P2 FCFS P4 Compute Waiting times in ready queue P2 P1 P3 P4 average