$($Please include visuals and update height of each node with each steps$)$

Perform the following operations on an AVL tree. Assume the tree is empty initially. After each operations recalculate the height of the nodes on the path from the added node to the root. If any of the node is unbalanced, perform appropriate rotations to balance the tree. Your work should show the intermediate steps. Add $10,$ Add $20,$ Add $80,$ Add $60,$ Add $40,$ Add $50.$