(0) Feedback with 2 queues. Queue 1 serves 1 quantum (unit of time) at a time while queue 2 serves 2 quantums at a time. All processes get serviced from queue 1 initially and if they do not complete, they move to queue 2. Queue 2 runs a round robin scheduler. Assume that Queue 1 has a higher priority than Queue 2 and assume that a process arriving to queue 1 cannot preempt an already running process from queue 2 within its 2 quantums, Problem 5 Consider the following processes: Process Arrival Time Processing Time 12 Show how the above processes execute over time on a single CPU system. Compute the completion time for each process, and the average turnaround time for all processes under each of the following schedulers