I will upvote for correct answer There are 3 algorithms to solve the same problem. Let n = problem size. Supposethat their runtime complexities are as follows:Runtime complexity of algorithm 1: T₁ (n)logn=2 Σ₁k² +logn³ +4k=1Runtime complexity of algorithm 2: T₂(n)8n² + 2n+n√nRuntime complexity of algorithm 3: T3(n) = n logn + log4 nª + 64nFind asymptotic tight bound (Big-✪) of each runtime complexity, e.g. write T₁(n) = ☺(...). Whichalgorithm's runtime has the biggest growth rate, and which one has the smallest growth rate? Whichalgorithm is the most runtime efficient?

There are 3 algorithms to solve the same problem. Let n = problem size. Suppose that their runtime complexities are as follows: Runtime complexity of algorithm 1: T₁(n) = 2 Σ₁k² +logn³ + 4 logn k=1 Runtime complexity of algorithm 2: T2₂ (n) = 8n² + 2n + n√n Runtime complexity of algorithm 3: T3 (n) = n logn + log4 n¹ + 64n Find asymptotic tight bound (Big-0) of each runtime complexity, e.g. write T₁(n) = 0(...). Which algorithm's runtime has the biggest growth rate, and which one has the smallest growth rate? Which algorithm is the most runtime efficient?