Draw an AVL tree whose elements are the letters A-Z. Label each node with its balance factor. Draw a second non-AVL tree whose elements are from A-Z. Label each node with its balance factor and mark the unbalanced node. Explain why the second tree is not an AVL tree. Draw the binary search tree whose elements are inserted in the following order: 17 11 22 5 13 19 20 Is the resulting tree an AVL tree? Explain why or why not