Write upper bound recurrences (not solutions) for Tn, the worst-case the complexity for the following problems, where n is the input size. So, Tn (your answer).

1. (i) The divide-and-conquer method for finding a majority element in a set {x1, . . . , xn} known to have a majority element. You can only use the identity oracle (i.e., the oracle that answers the question, is x = y?).

2. (ii) The median-of-5 algorithm for finding the k-th smallest of n numbers. (Binary comparison oracle.)

3. (iii) Binary search in a sorted set of size n using a ternary comparison oracle.