1. Construct a binary search tree from the data given below:

45, 26, 35, 47, 59, 65, 87, 24, 17, 90, 43, 10, 34, 71

b) Calculate the Balance of each node of the Binary Search Tree constructed in Question 1.

c) Apply AVL Algorithm to balance the Binary Search Tree constructed in Question 1 if required.

4. Consider the integer data: 5, 6, 8, 4, 9, 2, 1, 3, 7, 0. Write the output of the 1^st and 2^nd iteration:
   1. in selection sort.
   2. in insertion sort.
   3. in bubble sort.

Write a recursive function that accepts (input) your first name in reverse order and displays it in a correct order.