Exercise $3.$ Use Master Theorem to find the running time of a recursive algorithm in big$-$Oh notation if its

running time is described by the following functions. If Master Theorem is not applicable, or if does not yield

any result, mention that as well.

a$)T(n)=8T(\frac{n}{4})+n^2+logn$