Exercise 7 [3 points) Consider a min-heap with n > 7 distinct elements stored as an array A. Use a proof by contradiction to prove that the second-largest element has an index in A in the range [L] +1...n]. (Hint: consider the indices of the children.)