1. [10pts] Given any set of n distinct keys (identifiers) and an arbitrary binary tree T on n nodes, use mathematical induction to show that there is a unique assignment of the keys to the nodes in T such that I becomes a binary search tree for the keys. Hint. First show that there is a unique assignment of a key to the root