Then use the following main method to test your binarySearchRecursive method. public static void main(String[] args)f initialize an unsorted array int[] arr = new int[](934,2,1 5,90,56,44,78,1 2,23,86); Arrays.sort(arr); sort the array in ascending order int key = ; //test the program with key values 34. 3, 107, 15 int position = binary:SearchRecursive (arr, key, 0, arr length-l .) ; if (position !=-1) System.out.println" Found search key "+ key +" at index" position)