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 sinply reports the naximum valued stored in the data structure at the tine of the call 3. (5 points) Suppose that we use a binary heap to support this program. What is the asymptotic worst case running time for n Insert, n Find() and 15 Max) operations? 1. (5 points) Suppose that we use a red-black tree to support this program. What is the asymptotic worst case running time for n Insert, n Find() and 15 Max) operations? (a) 0(n) (b) 0(n log n) (c) 0(n2) (d) 0(n 2 log n) (e) 0(n3) (a) 0(n) (b) 0(n log n) (c) 0(n2) (d) 0(n 2 log n) (e) 0(n3) Answer: 4. (5 points) BRIEFLY explain your choice above Answer: 2. (5 points) BRIEFLY explain your choice above 5. (5 points) 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) 0(n) (b) 0(n log n) (c) 0(n2) (d) 0(n 2 log n) (e) 0(n3) Answer: 6. (5 points) BRIEFLY explain your choice above 7. (5 points) Which of these three data structures would you pick to support n Insert), n Find) and 15 Max) operations? Briefly justify your