Professor Bunyan thinks he has discovered a remarkable property7 of binary- search trees. Suppose that the search for key A- 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 Bunyan claims that any three keys aeA, beB, and ceC must satisfy a lessthanorequalto b lessthanorequalto c. Give a smallest possible counterexample to the professor s claim