3.4 Suppose we start with an empty BST, and want to insert the keys 1 through n into the BST. (b) Assume n = 2" 1 for some h. Describe an order we could insert the keys so that the resulting tree has height h. (c) Given a random permutation of the keys 1 through n, what is the probability that if the keys are inserted in this order, the resulting tree has height n