QUESTION 26 1. Given an array of elements 5, 7, 9, 1, 3, 10, 8, 4, build a binary max-heap, match answers with the questions. (5 points) Formula to find the height of the tree. Formula to find the left children of any random node in a heap tree. A condition to fulfil a heap property. A characteristic of a heap. + The list of elements in the array after 1 deletion A.5943781 B. n = 2h+1 -1. C. A partially ordered list D.5491378 E. binary tree F. 2n+1