Please answer the following question completely showing all work, I will upvote, thank you!

1. [10 marks] 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) Tn) T(n) 1 when n=1 8T(n/4) + n when n>1 b) T(n) T(n) 1 when n=1 2T(n-1)+1 when n>1 Master Theorem For T(n)= A T(n/B) + O(n) where A2 1,B> 1 T(n) = O(nloga 4), A>B* O(n* log n), A=B* Qn*), A