Question 4 (1 points): consider a multi-level feedback queue scheduler with 4 priority levels: • priority 3 (highest), where processes run with a 1 ms quantum • priority 2, where processes run with a 5 ms quantum • priority 1, where processes run with a 10 ms quantum; and • priority 0 (lowest), where processes run with a 100 ms quantum whenever a process finishes running without using its entire time quantum, it is moved up to a higher priority level (except if it is already at the highest priority level) for the next time it is runnable. if a process is still runnable after using its entire quantum, it is moved down to a lower priority level (unless it is already at the lowest priority level). within each priority level, the scheduler uses round-robin suppose this scheduler is running two processes: * process a which alternates between performing 5 ms of computation and starting and waiting for an i/o operation that takes 50 ms to complete process b which alternates between performing 15 ms of computation and starting and waiting for an i/o operation that takes 25 ms to complete after the processes are running for a long time, a. o process a will alternate between priority 2 and priority 1, while process b will alternate between priority 1 and priority 0 b. o process a will alternate between priority 3 and priority 2, while process b will alternate between priority 2 and priority 1 c. o process a will alternate between priority 3 and priority 2, but process b might never run d. o process a will be at priority 3 whenever process b is waiting for its i/o, and at priority 2 whne process b is ready or running e. o process a will alternate between priority 3 and priority 2, while process b will alternate between priority 1 and priority 0 f. o none of the above