1.      Create an array of 25 positions in main.

2.      Fill it with random numbers from 1 to 25, inclusive.

3.      Call a recursive print method to print the array - be sure to print the position number and each of the values in the array (i and array[i]).

4.      Call a recursive sum method to total all the elements in the array and return the sum to main. Print the sum from main.

5.      Sort the array into descending sequence.

6.      Call the recursive print method again.

7.      Call a recursive binary search method to search for a value in the array. Return the location of the value found to the main method and print the location where the target item was found in main.

8.      Call the recursive binary search method to search for a value not in the array. Return a -1 from the method so main can print that the value was not found.

9.      Call an iterative sum method to sum the values in the array. Print this total and use it to desk check the total developed by the recursive sum method.