(5) Recall that a leaf node of a heap is a node which does not have any children. An internal node is a node which is not a leaf, i.e., a node which has at least one child. Prove that the number of leaves in an n-element max-heap is [n/2). (10 points) Hint: Remember that every heap has an associated array with n elements, starting with index 1, such that, for every i E {1,...,n}, Parent(i) = Li/2], Left(i) = 2i, and Right(i) = 2i +1. To get started on the problem, consider 2i and 2i +1 when i > [n/2] and when i [n/2] and when i