A binary tree is stored in an array called treeNodes, which is indexed from 0 to 99, as described in the chapter. The tree contains 85 elements. Mark each of the following statements as True or False, and correct any false statements. 1. treeNodes[42] is a leaf node. 2. treeNodes[41] has only one child. 3. The right child of treeNodes[12] is treeNodes[25]. 4. The subtree rooted at treeNodes[7] is a full binary tree with four levels. 5. The tree has seven levels that are full, and one additional level that contains some elements.