ready queues. Jobs Suppose we have a multi-level CPU scheduling algorithm that uses two entering the system are place on the first queue which is scheduled using round-robin (RR) with a CPU time quantum of 4 milliseconds (g4). After receiving 2 quantum time units (8 milliseconds total), a job that has not yet finished is placed on the second queue which is scheduled using first-come, first-served (FCFS). Jobs in the second queue receive CPU service only when the first queue is empty. Suppose the following processes arrive at the first queue in the order listed at time 0: CPU burst time (ms) Priority Process Pi P2 Ps P4 Ps 4 (a) (5 points) Draw a Gantt chart showing when each process receives CPU service for this algorithnm Assume no other processes arrive (b) ( 5 points) Give the order that the processes finish for this lgori th (c) (5 points) What is the average waiting time for this set of processes using this algorithm? (d) (5 points) What would be the average waiting time for this set of processes if the shortest-job-first (SJF) CPU scheduling algorithm were used alone? (e) (5 points) What would be the average waiting time for this set of processes if a non-preemptive priority CPU scheduling algorithm were used algne? (Larger number is higher priority.)