Let A be an array of n integers. The frequency of a in A is the number of times

a appears in A$.$ For instance, if A $=[0,2,0,1,3,3,1,0,5],$ elements $\{2,5\}$ have frequency one,

elements $\{1,3\}$ have frequency $2$ and $0$ has frequency $3.$ Give a $\backslash$Theta $($n log n$)$ time algorithm finding

the most frequent element in A$.$ If multiple elements have the maximal frequency, your algorithm

can return any one of them