A complete binary tree is stored in an array called tree Nodes, which is indexed from 0 to 99, as described in Section 8.9. The tree contains 85 elements. Mark each of the following statements as true or false, and explain your answers. a. tree Nodes (42) is a leaf node. b. tree Nodes [41] has only one child. C. The right child of tree Nodes [12] is tree Nodes [25]. d. The subtree rooted at tree Nodes [7] is a full binary tree with four levels. e. The tree has seven levels that are full, and one additional level that contains some elements