algorithms problem

Problem #5. a- What is the maximum and minimum height of an AVL tree of 12 nodes? Given an example for each case. b- Consider the following BST, insert numbers 10, 40, 50, and 30 into the BST in the mentioned order. For each insertion, balance the tree using AVL technique, and show height (H) and height balance-rotation code (BC) of each node in each step. H=2 BC = 1 H=0 H 1 15 28 BC = 0 25 37