1. Write a Java pseudocode that uses recursion to accomplish the task. Here is a hint. When you are searching for a particular value in an array, there are two possible outcomes. 1) The value is found and the array index of that value is returned. 2) The value is not found and we return -1.

2. Convert the pseudocode in 1 above into a working Java program. Submit the program separately as a java file with the file name MyBinarySearch.