Problem 4: Asymptotic Efficiency For a given problem, suppose you have two algorithms: A1 and A2 with worst-case time complexity of Ti(n) and Tz(n), respectively. For each part, answer the following four questions: Tl If your goal is to pick the fastest algorithm for large n, would you pick Ai or A2? (a) Ti (n) = 5Vn + 1082 n + 3 and T(n) = 100)lo82 n + 25 (b) T (n) = 5V n + In n and T2(n) = V . log2 n (c) T (n) = 5log10 n-20 and T(n)-| log2 n (d) T1(n) = 10n2/4 and T2(n)-yM, log2 n (e) T1(n) = 10(2 logio n) _ 2n and Ta(n) = 5n3 + 10n-3