A plurality of an array is the number that occurs more than any other number.

For example, in the array [4, 5, 6, 7, 4, 5, 4], number 4 is the plurality (because 4 occurs most frequently). In the array [3, 5, 6, 7, 3, 5], there is no plurality (because 3 & 5 both occur most frequently).

Give an algorithm to find the plurality of an n length array, or report that no plurality exists. What is the complexity of your algorithm?

Rubric: No points for an incorrect algorithm. Scores for a correct algorithm will depend on the complexity. The faster the algorithm, the higher is your score. The algorithm must be written in java