can someone help with the following data structures problem

Problem #3:

(A) Show the result of inserting the following sequence of elements into an initially empty AVL-tree: 10, 20, 15, 25, 30, 16, 18, 19.

(B) Suppose we perform a physical deletion (NOT a lazy deletion) of the record with key=30, on the AVL-tree obtained from part (a). Show how the new AVL-tree will looked like after such operation.

(C) Show the result when an initially empty AVL-tree has keys 1 through 7 inserted in order.

(D) Draw an AVL-tree of height 4 that contains the minimum possible number of nodes.