Suppose you have a high-performance computer, which has a CPU containing a dedicated bank of k > 2 optimization registers. This bank of registers supports the insertion of key-value pair, (x, y), into the bank of registers in O(1) time, assuming that there are fewer than k numbers already stored in the bank. In addition, this bank of registers allows you to remove and return a key-value pair, (x, y), with smallest key, x, from the bank of registers in O(1) time. Show that you can use this high-performance computer to sort n numbers in O(n log n/ log k) time.