Suppose that we consider two algorithms for some Problem. One of them has (worst-case) time complexity function T(n) = 12n (log2 n) + n log2 n, the other has time complexity function T2(n) = 11n5 log2 n + 10n6. (a) Which of the time complexity functions grows faster? (b) Which of the algorithms works faster for large values of n (in the worst cases)? **First find the fastest growing summand and divide the other function by this function containing the fastest growing summand**