1. (1 pt) To go from a node to its left child, a Binary Search Tree uses (circle one): pointer index arithmetic 2. (1 pt) To go from a node to its left child, a min-heap uses (circle one) pointer index arithmetic 3. (2 pts) Describe an insertion order of the integers(1, 2, 3, , n) that would yield best-case runtime for building a min-heap but worst-case runtime for building a Binary Search Tree. 4. (1 pt) Which takes asymptotically longer in the worst case: (a) printing all values stored in a min-heap in order from least to greatest, (b) printing all values stored in a Binary Search Tree in order from least to greatest, or (c) neither? Answer. 5. (2 pts) Which takes asymptotically longer in the worst case: (a) Dijkstra's algorithm, (b) Prim's algorithm, or (c) neither