Problem 2. (30 points) Let A[1..n] be a sorted array of distinct integers. You want to find out if there is an index i such that A[i - i. Give a divide and conquer algorithm that solves this problem and runs in time Olgn). Write a peeudocode of your algorithm. Explain why your algorithm is correct. Justify the bound for the running time of your algorithm