Credit Problem 1 (5 pts). Suppose that we consider two algorithms for T, (n) = 12n'(log2 n)3 + n6 log2 n, T2(n) = 11 ns . log2 n + 1 0n6. some Problem. One of them has (worth-case) time complexity function the other has ti cmplexity function (a) Which of the time complexity functions grows faster? (b) Which of the algorithms works faster for large values of n? Use limits at infinity and explain your argument n detail