Solve all questions except Q5

(Note:: q4 will be solved according to c++)

Q4. Write recursive function for power calculation. i.e. power(base, exp), where, this function returns (base)exp Q5. Write heap sort program. Q6. a) Build BST from the following data: 12,5,7,18,1,20,14 b) Remove root node from the above tree Q 7. a) Transform the given array into a binary tree: 11 13 17 10 14 21 31 33 37 22 Index 0 1 2 3 0 1 2 3 4 5 6 7 8 9 b) Transform the given array into a perfect binary tree: A B C D E F G Index 0 1 2 3 4 5 6