In contiguous memory allocation, which statement correctly compares the Best-Fit and Worst-Fit memory allocation strategies in terms of fragmentation behavior?

Best-Fit searches the entire free list to find the smallest free block that is still large enough to satisfy a memory request, which minimizes wasted space for that single allocation but tends to leave behind very small, often unusable leftover fragments over time, contributing to external fragmentation. Worst-Fit instead deliberately allocates from the largest available free block, leaving a comparatively larger leftover fragment that has a better chance of remaining useful for future allocation requests, though it risks depleting the large contiguous blocks that bigger future requests might need.