Give asymptotic upper and lower bounds for T(n) in each of the following recurrences. Assume that T(n) is constant for n ? 2. Make your bounds as tight as possible, unless noted, and justify your answers.

* T(n) = 2T(n/2) + n⁴

* T(n) = T(7n/10) + n

* T(n) = 16T(n/4) + n²

* T(n) = 7T(n/3) + n²

* T(n) = 7T(n/2) + n²

* T(n) = 2T(n/4) + sqrt(n)

* T(n) = T(n-2) + n²

Note: If the Master method fails, use a recursion tree / substitution and provide only a lower-bound.

Note: If you are planning to write this on paper, write it clean and neat, otherwise typing it is fine.