Question 5 a) Show steps to insert the following elements, in this order, into the AVL tree. Apply appropriate rotations where there is a need. 6,3,5,4,15,7,9,8,13,14 [10] b) Write class interfaces required to implement an AVL tree. [4] c) Write down the implementation of the method that calculates the height of an AVL tree. [6] d) Explain with examples why AVL tree is better than a binary search tree in terms of searching [5]