Write a Java application that implements the recursive Binary Search alogrithm below:

Write a Java application that implements the recursive Binary Search alogrithm below:/** * Performs the standard binary search using two comparisons * per level. This is a driver that calls the recursive method * @return index where item is found or NOT FOUND if not found */public static > int binarySearch(AnyType [] a, AnyType x) {return binarySearch(a, x, 0, a.length -1);}/** * Hidden recursive routine. */private static > int binarySearch(AnyType [] a, AnyType x, int low, int high {if(low > high) return NOT_FOUND; int mid = (low + high)/2; if(a[mid].compareTo(x) 0) return binarySearch(a, x, low, mid - 1); else return mid;}