Write an algorithm in a pseudocode form to find the most frequent element in a random array A[1...n] in O(n) time; where n is the array size. For example, if the array is {5,9,5,8,2,5,9,2}, the most frequent element is 5. (to be returned from the procedure) as 5 occurs 3 times in the array. If there are multiple elements that appear a maximum number of times, then you can return any one of them. All the elements of the array are in the range [1,100]. Also, n >> 100 (n is significantly greater than 100). You are not allowed to use more than constant extra space i.e. use of a few variables is allowed. There will be no credit for a solution that will take more than linear time or more than constant extra space.