Problem:
Suppose we are given as input an unsorted list of n items, some of which may have the same key.
Question- Describe an O(nlogn) time algorithms for finding the key that occurs the most times, and the number of times that key occurs.
Step by step instructions so I can understand would be greatly appreciated!