Question $1$:

For $n=1,2,3,4,$ and $5,$ draw all the binary trees with $n$ nodes that satisfy the balance

requirement of AVL trees.