Draw a binary tree of height 3 that can be an AVL tree and has the smallest number of nodes among all such trees. Note that the height of an empty tree is height -1. And the height of a tree with only a root node is 0. (b) Draw a binary tree of height 2 that can be an AVL tree and has the largest number of nodes among all such trees