Given any set of k distinct keys (identifiers) and an arbitrary binary tree T on k nodes, how can you use mathematical induction to show there is a unique assignment of the keys to the nodes in T such that T becomes a binary search tree for the keys. Hint: First show there is a unique assignment of a key to the root