help with this c++ question I am having a hard time understanding

(7 points) Considering the statements below, indicate the sum of the values corresponding to all statements that are True. If none are True, the answer should be 0: (1) In the worst-case, the up-heap method of a binary heap is less expensive than down-heap (2) The minimum number of nodes in a binary heap if height h is 2 (1) Assuming a BST with keys between 1 and 500, after searching for 256, the sequerice 352, 28, 40,50, 45, 47, 46 could be a valid sequence of nodes examined (8) Given the in-order traversal of a BST, you can infer the exact structure of the tree 10