Insert the following items into an AVL Tree accounting for any rotations: $7,6,3,1,9,4,5,0$ Note that the elements are inserted in the aforementioned order. State the left to right level order traversal of the tree separated by spaces, e$.$g$.1234$Hint $($Rotation algorithm$)$:If tree is right heavy $\{$IF tree's right subtree is left heavyPerform Right$-$Left rotationELSEPerform Left rotationELSE IF tree is left heavyIF tree's left subtree is right heavyELSEPerform Left$-$Right rotationPerform Right rotation