7. For each of the following recurrences, give an expression for the runtime T(n) if the recur- rence can be solved with the Master Theorem. Otherwise state why the Master Theorem cannot be applied. You should justify your answers. For each recurrence, you will get 2 marks for a correct answer and 1 mark for a correct justification. (a) T(n) = T(n/4) +5n. (b) T(n) = 4.T(n/2) + 2nlog, n. (c) T(n) = 2. T(2n) +n. (d) T(n) = 27. T(n/9) + 8 log2 n. (e) T(n) = V.T(n/20) +3n