a$.$ Inserting a node with value of $1$ as left child of $3$ gives the below, show how the

AVL tree balances itself. Explain the steps followed.

b$.$ Inserting a node with value of $9$ as right child of $8$ in the initial AVL tree gives the

below, show how this AVL tree balances itself.