Given a sorted array (in ascending order) of distinct integers A[1 .. N], give a Decrease-and-Conquer (Divide-and-Conquer) algorithm to find out whether there is an index i for which A[i] = i. Analyze its complexity.Given a sorted array (in ascending order) of distinct integers A[1 .. N], give a Decrease-and-Conquer(Divide-and-Conquer)algorithm to find out whether there is an index ifor which A[i] = i. Analyze its complexity.