Give big-O bounds for T(n) in each of the following recurrences. (Substitution or Recursion Tree)

7a) T(n) = T(n-1) + n

7 b) T(n)= T(n/4) + T(n/2) + n^2