2 1 4 5 9 3 6 7

Incrementally build an AVL tree for the above data where each number is a key. For each key, show the tree after the key has been inserted, then mark nodes where the need for rotation is detected with an asterisk, indicate the nature of the rotation (single or double), and show the result of the rotation.