Give a recursive algorithm that gets a sorted array (of integers) as input and constructs a Balanced BST. Your algorithm should not use balancing ideas such as AVL balancing Trees. Your algorithm must be a recursive algorithm. Write the recurrence relation for the run-time and solve the recurrence. You will receive zero credit, if your algorithm is not recursive. Your grade depends on the run-time of the algorithm