give an efficient algorithm in pseudocode to determine if there exists an integer i such that a[i] = i in an array sorted in ascending order. what is the running time of given algorithm?