Draw an AVL tree that results from inserting the keys: 3, 9, 2, 7, 4, 5, 8 in that order into an initially empty AVL tree. The result of the tree should comply with Binary Search Tree requirement as well. You are required to show the tree formation process and rotation involved.