The general form of a recurrence relation is: T (n) = aT (n/b) + f (n).

(a) Let f (n) = n. For each value of a ? {2, 3, 4} and for each value of b ? {2, 3, 4}, solve the recurrence relation. Express your answer in a 3-by-3 table. (b) Repeat, assuming f (n) = log n. (c) Repeat, assuming f (n) = n log n. (d) Repeat, assuming f (n) = n 2 .