$2\mathrm{.}15$ Give an efficient algorithm to determine if there exists an integer i such that $A_i=i$ in an array of integers $A_1.$ What $is$ the running time $of$ your algorithm?