Java

1. You were shown an iterative version of the binary search algorithm. Create a recursive solution in a file called Search.java that uses the following method signature: // precondition: A is not null I/ postcondition: returns true if and only if A contains key. public static boolean binarysearch(int[] A, int key, int 10, int hi) Hints: - Each recursive call to binarySearch will have you searching for key in the range A[lo...hi]. Therefore, the first call to binarySearch () will be when lo =0 and hi=A.length 1. - Your base cases should coincide with the ways in which an iterative binary search exits. - Your recursive cases will have you searching one half of A[] according to how key compares to A[mid]. This should be clear from the iterative version of the algorithm