Solve the following recurrences. Give the answer in terms of Big-Theta notation. Solve up to constant factors, i.e., your answer must give the correct function for T(n), up to constant factors. You can assume constant base cases, i.e., T(1) = T(0) = c, where c is a positive constant. You can ignore floors and ceilings. You can use the DC recurrence theorem if it applies.

k) T(n) = T(7n/8) + n