Consider a max-heap H of size n > 2 of distinct elements. a. (7 points) What is the maximum number of element comparisons that are needed to find the second largest element in H? Clearly justify your answer. b. (13 points) What is the minimum number of element comparisons that are needed to find the minimum value in the max-heap? Clearly justify your answer by outlining the algorithm and analyzing its cost. Ad Go