Shоw the AVL tree thаt results аfter eаch оf the integer keys: 8, 2, 10, 30, 4, 24, and 37 are inserted, in that оrder, into an initially empty AVL tree. Clearly show the tree that results after each insertion, and make clear any rotations that must be performed. Trees may be represented in text layer by layer.