14:44 1. Modify the "BinarySearch" program so that if the search key is in the array, it returns the largest index i for which a[i] is equal to key, but otherwise, returns-i where i is the largest index such that ai is less than key. It should also be modified to deal with integer arrays rather than string arrays. Note: The program should take two command- line arguments, (1) an input file that contains a sorted integer array; and (2) an integer to search for in that array public class BinarySearch public static int search(String key, Stringl] a) t return search(key, a 0, a.length); public static int search(String key, Stringl] a, int lo, int hi) lSearch for key in a[lo, hi). if (hi lo) return-1; int mid lo+ (hi - lo)/2; int cmp-almid].compareTo(key); if (cmp > 0) return search(key, a, lo, mid) else if (cmp