you're given a sorted (from smallest to largest) array A(n) distinct integers which can be positive,negative or zero, you want to decide wether or not there is an index (I) such that A[I] = I. design the fastest algorithm that you can use for solving this problem