1) Following the binary search algorithm (final version) in the lecture notes, write a recurrence relation for the running time T(n), where n is the input size, of the algorithm. 2) Give the best asymptotic upper bound for the running time of the algorithm, using the master method