True/False True is A and False is B Indicate whether the statement is true or false The size ofa list is a fixed value, i.e., it does not change o 1. 2. The binary search algorithm is an efficient way for us to se Every node in a tree, except the root, has exactly one parent n 4. Each node in a tree can have multiple successor (child) nodes. 5. Any node in a tree can be viewed as being the root of its 3. in its right subtree plus n a tree is equal to the number of nodes in its left subtree plus the number of no 7. Our Priority Queus must implement an sFull peration tree is 8. A Heap is based on a complete binary tree. Multiple Choice Identify the choice that best completes the statement or answers the question. 9. In our circular linked list the list element itself references a. the first node b. the last node c. both the first and the last nodes d. a list descriptor 10. Our Heap class implements a. Queuelnterface b. ListInterface c. PriQueuelnterface d. all of the above