This is not a programming assignment. Write code or pseudocode. 1. Given an array A, return a list that has those elements of A that occur most often, in the order of their first appearance in A. Solve the problem using hash tables in expected time of O(n). For example, if A- (2,6,3,4,5,4,6,3,5,4,5,6). mostoften(A) returns (6,4,5). All three elements appear 3 times in A, more often than the other elements, and the first occurrence of 6 in A is before the first occurrences of 4 and 5, and the first occurrence of 4 is before the first occurrence of 5. Analyze the expected running time of the algorithm. Note: output was given wrongly as (6.4)- Correct output is (6.4.5)