C++

1. This problem considers several ways to compute xn for some n 0. 1) Write an iterative function power1 to compute xn for n 0. 2) Write a recursive function power2 to compute xn by using the following recursive formulation: x 0 = 1; x n = ( x n / 2 ) 2 if n > 0 and n is even; x n = x * ( x n / 2 ) 2 if n > 0 and n is odd .

2. Write a recursive binarySearch function for an array of strings (already sorted), that returns the indexes of all the strings whose first letter is A / a.

For example, for anArray = {Arrow, art, box, curve, line}, the search result should show: indexes = {0, 1}.

Notes: You should set the target letter to be a variable, so we can use your function to search strings starting with any given letter withing a-z / AZ.

3. Write a main() function that tests all the above functions, with two test cases for each function. You may create a menu of choices for user to choose which function to test.