A system uses a Multi$-$Level Feedback Queue $($MLFQ$)$ scheduling algorithm with three queues, each with a different priority level. The highest$-$priority queue has the shortest time slice of $5$ milliseconds, the middle$-$priority queue has a time slice of $10$ milliseconds, and the lowest$-$priority queue has a time slice of $20$ milliseconds. Processes are moved to a lower$-$priority queue if they use their entire time slice without completing. A process can be moved back to a higher$-$priority queue if:

Choice $1$ of $4$:It requests I$/$O and becomes blocked.Choice $2$ of $4$:It uses up all of its allocated time slice.Choice $3$ of $4$:It spends some time waiting in the lower$-$priority queue.Choice $4$ of $4$:It voluntarily yields the CPU.