Suppose you are given n positive integers to sort on a special computer which has access to special memory containing p slots. The special memory supports storing a key-value pair (a, b) into the memory in O(1) time (assuming there is space) and extracting (that is, remove and return) the pair (a, b) with smallest a in O(1) time. Write an algorithm to show how this special computer can be used to sort the given n integers. Is your algorithm better than insertion sort? How about Merge Sort?