THE VALUES INSIDE ARE WRONG

Consider the following set of processes, with the length of the CPU service time given in milliseconds: Process Arrival Time Processing Time 6 Fill in the following table, illustrating the execution of these processes using the preemptive multilevel feedback queue (FBQ) algorithm. The scheduling quantum is 1 ms (l.e., it picks a new task at the end of a quantum). There are four priority queues and a new task starts off in the highest priority queue and loses one level of priority after each run until it gets to the lowest priority queue. In a case of a tie, the task is scheduled in the FCFS order. Again, assume that a task is inserted into each priority queue in a first come first serve order. Enter "-" for each slot that is unused 0-1 1-2 2-3 3-4 4-5 5-6 6-7 7-8 8-9 9-10 10-11 11-12 12-13 13-14 14-15