2 Understanding Binary Search Trees (20 pts) Suppose we are searching for some key x in a BST. As we perform the search, we compare x to the keys on the path from the root to the leaf in the BST. Which sequences below cannot be the sequence of keys examined during the search? Explain why not. Do not assume that the searches below are performed on the same BST. (a) (4 pts) 4, 10, 8, 7, 5 (b) (4 pts) 45, 15, 88, 75, 52 (c) (4 pts) 1, 2, 10, 4, 8, 5 (d) (4 pts) 1, 10, 2, 9, 3, 8, 4, 7, 6, 5 (e) (4 pts) 2, 7, 3, 8, 4, 5