Give the asymptotic complexity of each of the following functions in simplest te

Question

Give the asymptotic complexity of each of the following functions in simplest terms. Your solution should have the form Theta (n^alpha) or Theta ((log_mu(n))^beta) or Theta(n^alpha(((log_mu(n))^beta) or Theta(gamma^delta n) or Theta (1) where alpha, beta, gamma, delta, mu are constants. (No need to give any justification or proof.) (a) f_a(n) = log_2(3^n + 2 + 5n^3 + 1): (b) f_b(n) = n^0.1 times lg(4n^5 - 3 n^3) + 3n^0.2: (c) f_c(n) = 3 log_4(4n + 1) times log_3 n + log_2(6n^2 + 8n): (d) f_d(n) = 6^13 + 2^6 times 7 log_4(62): (e) f_e(n) = 2(n + 4) log_3 (2n^3 + 1) + 5n + squareroot 2n: (f) f_f(n) = 15^n - 10^n + n^100: (g) f_g(n) = 8^squareroot n + 2^n: (h) f_h(n) = 3 times 5^n + 9 + 6 times 3^n + 9: (i) f_i(n) = squareroot 2 n^3 + 3 n^2: (j) f_j(n) = 9 times 2^log_2(n^2 + 2n): (k) f_k(n) = (3 log_4(n^2 + 8) + 6 squareroot n) times (log_5 n + 4 log_3 n): (l) f_l(n) = 3^4n + 4^3n: (m) f_m(n) = 5 log_10(7 n^3 - 6n + 9) + 9 log_2 (5 n^4.5 + 33n): (n) f_n(n) = (4n^3 + 2n^2 + 1) * (n^2 + 5n + 13) * (12n - 6): (o) f_o(n) = log_10(4^n +6^n + 8^n);

Explanation / Answer

Could you please reupload the question because the image is too small so that the question is not visible properly.Its some what ok but the powers of functions and all other numbers are not clearly visible.

Related Questions

Navigate

• Browse (All)
• Browse G
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.