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

B) The following items are inserted into an AVL tree: 1, 2, 3, 8, 6. How many and what type of rotations are performed? Justify.

Note: We assume that double rotations count as one rotation. Important Notes:

For this problem, you don't 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. AVL-trees that were drawn by hand will be not accepted.