Problem
1. Draw the comparison tree for binary_search_1 for searching a list of length (a) 1, (b) 2, and (c) 3.
2. Draw the comparison tree for binary_search_2 for searching a list of length (a) 1, (b) 2, and (c) 3.
3. If the height of a 2-tree is 3, what are (a) the largest and (b) the smallest number of vertices that can be in the tree?