Using alphabetic sequence as the criteria, draw an AVL binary tree from the given words: MAD, AGE, LOW, NOW, EGO, OWL, APT, BAG, RIM and KIN. The words are to be taken strictly from left to right, one at a time. All the stages of the growing tree are to be shown with proper insertion and balancing operation.