We want to support the operations Insert(), Find() and Max() for a program that uses n Insert(), n Find() and 15 Max() operations. These operations can be performed in any order. The Max() operation simply reports the maximum valued stored in the data structure at the time of the call. 

Suppose that we use a hash table with a "good" hash function to support this program. What is the asymptotic "average" running time for n Insert(), n Find() and 15 Max() operations? (a) O(n) (b) O(n log n) (c) O(n^2) (d) O(n^2 log n) (e) O(n^3) Answer: BRIEFLY explain your choice above. 2) Which of these three data structures would you pick to support n Insert(), n Find() and 15 Max() operations? Briefly justify your answer.