QUESTION 5 Consider the following statements. 1) In B+ trees, the length of a path from a root to a leaf node can differ by 1 from the length of a path from the root to another leaf node. 2) In a B+ tree, where the maximum number of keys in an interior node is 5, the minimum number of keys in an interior node is 2. O Both statements are true. O 1) is true, 2) is false. O 1) is false, 2) is true. O Both statements are false. QUESTION 6 What is the maximum height of the root of a B+ tree of order m=100, with L = m=100 for the leaf nodes, when the tree contains 1,000,000 data elements? 04 O 5 06 07 QUESTION 7 Consider the following statements: 1) The second smallest element in a min-heap must be a child of the root. 2) In a min-heap, the largest element is always on a leaf. O Both statements are true. O 1) is true, 2) is false. O 1) is false. 2) is true, O Both statements are false