What is the recurrence relation that describes the asymptotic complexity of binary search, as a function of n, the number of items in the input list?
1) T(n) = 2 * T(n-1) + Th
2) T(n) = 2 * T(n-1) + T(h)
3) T(n) = 2 * T(n-1) + T(n)
4) T(n) = 2 * T(n-1) + T(hn)