Draw the AVL tree that results from inserting the keys: 1, 9, 5, 3, 6, 2, 4 in that order into an initially empty AVL tree. Draw the intermediate steps e. f. What is the minimum and maximum number of nodes in a complete tree of height 6? (Hint: the height of a tree consisting of a single node is 0) What is the maximum number of leaf nodes in a binary tree of height h? Give a formula in terms of h for your answer. g. What is the minimum and maximum number of nodes in a balanced AVL tree of height 5? (Hint: the height of a tree consisting of a single node is 0) h