Given an array of elements A[1,...,n], give an O(nlogn) time algorithm to find a majority element, namely an element that is stored in more than n/2 locations, if one exists. Note that the elements of the array are not necessarily integers, so you can only check whether two elements are equal or not, and not whether one is larger than the other