Give an algorithm that determines, for a sorted array of distinct integers, whether there is an index i for which A[i] == i. Prove your algorithm's correctness and analyze its runtime. (Hint: See if you can first prove something about how many crossover points there could be, if you compare entries where A[i] > i, and entries where A[i]