Set up and solve a recurrence relation for the running time of binary search on an array of n…

Set up and solve a recurrence relation for the running time of binary search on an array of n elements. Hint: To simplify, it helps to take T (n) as an upper bound on the running time of binary search on any array of n or fewer elements (rather than on exactly n elements, as would be our usual approach).