(Local minimum of an array) Write a JAVA program that, given an array _a[] of N distinct integers, finds a local minimum: an index i such that both a[i] < a[i-1] and a[i] < a[i+1] (assuming the neighboring entry is in bounds). Your program should use ~2 lg N compares in the worst case.