please help!!

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 Ai - i algorithm that solves this problem and runs in time O(log n). Write a pseudocode of your algorithm. Explain why your algorithm is correct. Justify the bound for the running time of your algorithm. ex 2 Suc 2. Give a divide and conguer