THERE ARE ONLY 2 RIGHT ANSWERS AND THE REST 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 Round-Robin algorithm. Assume that when a task arrives and there are other tasks already waiting in the scheduling queue, the new task is added to the end of the queue. Also assume that a task that is coming of the processor would get back into the queue at the end of the cycle while a new task arrives at the beginning of the next cycle. The queue operates in FIFO 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