Prove rigorously that f(n)=n? - 47n2 +18 = (nº). 2. You have an algorithm with its running time satisfying the recurrence T(n) = 3T (n/4) +n. Use Master Theorem to find the asymptotic bound on the algorithm's running time.