Professor bunyan thinks he has discovered a remarkable property of binary search trees. suppose that the search for key kk in a binary search tree ends up in a leaf. consider three sets: aa, the keys to the left of the search path; bb, the keys on the search path; and cc, the keys to the right of the search path. professor bunyan claims that any three keys a \in aa∈a, b \in bb∈b, and c \in cc∈c must satisfy a \le b \le ca≤b≤c. give a smallest possible counterexample to the professor's claim.