The Worst$-$Fit memory allocation algorithm finds out all holes or empty spots from the memory where a process is fit to accommodate. Among these holes or empty spots, the worst$-$fit algorithm selects:

The Worst$-$Fit memory allocation algorithm finds out all holes or empty spots from the memory where a process is fit to accommodate. Among these holes or empty spots, the worst$-$fit algorithm selects:

the smallest hole or empty spot to accommodate a process

the largest hole or empty spot to accommodate a process

the medium hole or empty spot to accommodate a process

any hole or empty spot to accommodate a process