Data Structure and Java. Problem, please show all the steps to solve this problem.

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 1) Implement an efficient program in Java that, given an array with the previous property, determines whether a given integer is in the array. 2) What is the running time complexity of your program? Justify.