Question 2. (24 points. Recall that in Assignment 1, we developed recursive algorithms for implementing the specification Given a non-decreasing array A1..n], and given a value v, return a number r such that ifr=0 then v does not occur in A[1..n] ifr #0 then 1