Determine Big O for the following recurrence relations using the Master Theorem if applicable, otherwise use Repeated Substitution. Show your work. Simplify the answer.

a) T(n) = 1 when n=1 T(n) = 8T(n/4) + n2 when n>1

b) T(n) = 1 when n=1 T(n) = 2T(n - 1) + 1 when n>1.