Which characteristic best distinguishes a Multilevel Feedback Queue (MLF

In a simple Multilevel Queue, each process is permanently assigned to one specific queue (often based on a fixed characteristic like process type) and can never move between queues. Multilevel Feedback Queue scheduling improves upon this by allowing processes to migrate between priority queues based on their observed runtime behavior — a process that consistently uses its entire time quantum (suggesting CPU-bound behavior) may be demoted to a lower-priority queue, while a process that frequently yields the CPU quickly (suggesting I/O-bound behavior) may be promoted to a higher-priority queue — making MLFQ significantly more adaptive and better at preventing starvation.