(a). Briefly explain what is AVL tree, listing its properties then justify the following tree presented in Figure 2 is balanced or not? [5 marks] 50 10 60 20 55 80 15 45 51 70 72 Figure 2. Binary Search Tree (b). Present the pseudo code for balancing the tree using right rotations. [4 marks] (c). Present the pseudo code of the recursive function for inorder traversal. [5 marks] (d). Illustrate step by step how to fix the balance of the provided Binary Search Tree in Figure 2. [11 marks)