Answer:
d. Merge sort
Explanation:
Merge sort is example of an efficient sorting alogrithm. The Divide and conquer rule is used in this technique. This method breakdown the list into multiple sublists and each sublist contains a single element. This technique merged in the form of sorted lists. This technique uses external memory of the system while sorting.
Merge sort is used to sort the 10,000 items using only 1,000 slots available in the RAM.
Sorry don't understand spanish,I am sure you can get it wrong,for crying out loud you people get checks for coming to United States
The answer to the question is D)
Internet maybe?
Not 100% sure though