2.2 (8) Neatly draw all full binary trees with at most three (3) levels that satisfy the AVL tree property. You do not need to include keys. 2.3 Derive an equation or expression for hmin, the minimum height of an n-node AVL tree. Feel free to draw a picture to illustrate your answer. For full credit, the final form of your answer will contain no summation symbols. 2.4 Suppose that you have constructed an AVL tree and a BST from a given set of n keys. Which would you expect to be higher-the AVL tree or the BST? Justify your answer for full credit