Professor Alf Witt thinks he has discovered a remarkable property of binary search trees. Suppose that the search for key k in a binary search tree ends up in a leaf. Consider three sets: A, the keys to the left of the search path; B, the keys on the search path; and C, the keys to the right of the search path. Professor Witt claims that any three keys a E A, b E B, and c E C must satisfy a s b s c. Give a small counterexample to the professor's claim. 8