Please show a simple unbalanced AVL tree that would require a LR rotation to become balanced. Please draw the unbalanced and balanced version of the tree. Please write the balance factor value on each node in the tree.

From the AVL tree you have built in part (b), 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.