My roommate has bought a pair of rabbits, Rowena and Salazar. We kept track of the number of offsprings every month in vector, r. We want to write an algorithm to find if given a number, q N, is in r. For instance, given the following sets, elements of q1 exist in r, whereas elements of q2 do not.

r = {1, 2, 3, 5, 8, 13, 21, 34} q1 = {2, 21, 34}

q2 = {5, 15, 35}

Write a recursive algorithm to solve the problem given above for any ordered set that uses the design technique discussed in class. If the query is found, return its index, otherwise, return 1. Your algorithm will be called using:

findFluffy( r, 0, r.length, query)

findFluffy(r, min, max, query) {

}

Calculate the time complexity of your approach.

T(n) =

(n) =