8 Let A[1:n] be an array of n distinct integers sorted in increasing order. (Assume, for simplicity, that n is a power of 2.) Give an O(logn)-time algorithm to decide if there is an integer i, 1in, such that A[i]=i. Your answer must include (a) a brief description of the main ideas (from which the correctness of the method should be evident), (b) pseudo-code, and (c) an analysis of the running time