Consider the following recursive functions:

$a_n=9a_{\frac{n}{3}}+n$

$a_n=3a_{\frac{n}{4}}+nlog(n)$

Use the Master$$s Theorem to analyse and compute the big O complexity of these functions.