6. Number of internal nodes in a 2-3 tree. Prove that a 2-3 tree with n leaves has at most n-1 internal nodes. Prove this by induction on the height of the tree; that is, the induction hypothesis is: Qh: For every 2-3 tree T of height h, if T has n leaves and m internal nodes, then msn - 1. Prove Qo directly (this is really trivial), and then prove that Qn-1 = Qn for all h > 0. To do this, use the proof of Claim 1 in Section 2 of the Notes on 2-3 trees as a template for your proof