Solve the following problem with recursion. Note that some of these problems can easily be solved by iterative methods (i.e., with for or while loops). But since the goal of this assignment is to help you practice recursion, you are required to come up with recursive solutions for them.
4.1. Write a program to find the smallest value in an array recursively.
4.2. Write a program to find the smallest absolute value in an array recursively
4.3. Write a recursive binary search program.
4.4. The sequence a(i) is defined below, write a recursive program to compute a(i).
4.5. The sequence b(i) is defined below, write a recursive program to compute b(i).
4.6. The sequence c(i) is defined below, write a recursive program to compute c(i).
For problems 4.4-4.6, find the smallest i that overflows a 32-bit integer.
As before, put all programs in one file and turn it in to http://220.127.116.11. Remember to provide test data and test drivers for each problem. The deadline is midnight, Dec. 24, 2005.