Question 1: You are given an array A[1...n] containing n distinct numbers. This array has the property that there exists an index m such that the subarray A[1...m] is increasing and the subarray Alm...n] is decreasing. Give an O(log n)-time algorithm (in pseudocode) that outputs this index m. Explain why your algorithm is correct. For example, on the input array Al1...9]- 3,7,8,9,6,5,4, 2,1], the output must be the index m4