suppose that you are given an array a of size n containing real numbers. how- ever, although a has n elements, it only has k distinct values (so numbers appear multiple times), where k ~ log log n (this means that asymptotically, k is approx- imately log log n). in class we saw how to sort an array of size n in o(n log n) time; show how you can sort a in better than o(n log n) time. you are allowed to create additional arrays to help you, but do not use more complex data structures, such as heaps, queues, etc. describe the algorithm and analyze its running time