Please help with the following questions:

Q5 Majority 18 Points Given an array of elements ai, 22, ..., An. Suppose that there are more than half > n/2) of the elements are same. We call that element as the majority. Example: For the array (5,3,5,7,5,7,3,5,5) with 9 elements, 5 is the majority because 5 appears 5 times. Q5.1 15 Points Describe an algorithm to find the majority for a given array (assume the elements are integers, and the majority exists). No justification of running time and correctness is required here. Q5.2 3 Points What is the running time of your algorithm? No justification is needed