Suppose we are searching for some key r in a BST. As we perform the search, we compare z to the keys on the path from the root to the leaf in the BST. Which sequence below cannot be the sequence of keys examined during the search? Explain why not. Do not assume that the search below is performed on the same BST 85, 76, 30, 15, 6, 1 13, 98, 28, 94, 33, 85, 48, 77, 51, 62, 55 99, 78, 44, 87, 57, 52 16, 33, 77, 54, 73, 60 67, 24, 74, 55, 48 Solution (e) is the option. In BST ,First we search for the root. If the key is greater than root then we recur in the right sub tree or we recur in the left sub tree. In (e) the root is 67. The key is not 67 that\'s why we recurred to left sub tree that is 24 less than 67. Now in the sequence it cannot be 74 because this number is greater that the root 67. The number in the sequence can be greater than 24 but strictly less than 67..