What are the sequence of AVL trees after inserting each character in the list {j, i, h, g, f, e, d, c, b,a } to an initially empty AVL tree? Note: please draw only one tree after each insertion. From the AVL tree you have built in first part, what are the sequence of trees after deleting each character in the list (i.e., delete j, delete i, delete, h, ...)? Note: please draw only one tree for each deletion.