Given a sorted array of distinct integers $A[1,$dots,$n],$ you want to find out whether there is an

index i for which $A[i]=i.$ Give a divide$-$and$-$conquer algorithm that runs in time $O(nlogn)......$no need of any coding i want algorithms sums