Note: You should NOT write or use a computer program to answer any of these questions. If you do so, you will get ZERO for that question.

Q7: 15 pts) Write the pseudo code for an algorithm (to which an array A is input) that uses at most two Hash tables to print an instance of all the duplicate elements (elements that appear more than once) in an array. For example, if your array A is: 7,4,8,7,2,3,4,10,10,2,4,8,3,6,9 the output of your algorithm should be: 7,4,10,2,8,3 The number of hash table searches made by your algorithm should be (n), where n is the number of elements in the array. Show that the number of hash table searches made by your algorithm is indeed (n)