Data structures and algorithms help needed. Please check your work and provide explanation if possible thanks

Insert the following items into an AVL Tree accounting for any rotations: 5, 1, 9, 6, 11, 7. 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 heavy Perform Right-Left rotation ELSE Perform Left rotation ELSE IF tree is left heavy{ IF tree's left subtree is right heavy Perform Left-Right rotation ELSE Perform Right rotation