Java problem:

c) Show the result when an initially empty AVL-tree has keys 1 through 7 inserted in order (1,2,3,4,5,6,7).

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

Important Notes:

For this problem, you dont need to submit any implementation in Java.

For all parts of this problem, you must draw the AVL-trees using the appropriate graphics tools at your convenience.