For a given problem, suppose you have two algorithms: Ai and A2 with worst-case time complexity of Ti (n) and T2(n), respectively. For each part, answer the following four questions: . Is T (n) = (T2(n))? If your goal is to pick the fastest algorithm for large n, would you pick Ai or A2? (a) T (n)-510810 n-20 and T(n)-)log2 n (b) (n)-10n2/4 and T2(n)-yM, 1082 n (c) Ti(n) - 10(21ogio ") - 2n and T2(n) - 5n3 + 10n -3