Apply the following operations (a-j) to an initially empty AVL tree (12 points): a. Insert 30 b. Insert 20 c. Insert 56 d. Insert 11 e. Insert 7 f. Insert 3 g. Insert 65 h. Delete 20 i. Delete 7 j Insert 55 (1) Please show the AVL tree after (e) Insert 7 (2) Please show the AVL tree after (f) Insert 3 (3) Please show the AVL tree after (h) Delete 20 (4) Please show the AVL tree after (j) Insert 55