Design and implement a recursive program of Binary Search algorithm. An iterative Binary

Search algorithm we discussed in the class.

For the recursive version, instead of using a loop to repeatedly loop for the target value, allow each call to

a recursive method check one value. If the value is not target, refine the search space and call the method

again. The indexes that define the range of viable candidates can be passed to the method.

The base case is either finding the target value or running out of data to search.

Design the program to work for on an array of sorted String objects