Given an array A of N distinct integer elements with the following property: • The first k elements (0 < k < N - 1) are in strictly increasing sequence followed by the strictly decreasing sequence. Example: A = {1, 3, 4, 5, 7, 14, 11, 7, 2, -4, -8}. It monotonically increases from 1 to 14, then decreases from 14 to -8 Implement a sub-linear (O(logN)) running time complexity program in Java that, given an array with the previous property, determines whether a given integer is in the array. Important Notes: • You must add the main method in your program in order to test your implementation. • There are no data errors that need to be checked as all the data will be assumed correct. • You can use the array of the previous example to test your program, however, I suggest that you also use other input arrays to validate the correctness and efficiency of your solution. • Your program MUST be submitted only in source code form (.java file). • A program that does not compile or does not run loses all correctness points.