Analysis of Algorithm course

Please print or write neatly

(1) In problem 1 to 2, solve the following recurrence with different methods that we learned in class. nk where n = 21 for a positive integer j, and k is a small positive integer. That is, find a function g(n) such that T(n) e(g(n)). The (1) terminating condition is intended to represent some small constant. T(n)-S 1. Use the Master Theorem to solve this recurrence. (10 points) 2. Use the recursion tree to solve the recurrence. (15 points) (1) In problem 1 to 2, solve the following recurrence with different methods that we learned in class. nk where n = 21 for a positive integer j, and k is a small positive integer. That is, find a function g(n) such that T(n) e(g(n)). The (1) terminating condition is intended to represent some small constant. T(n)-S 1. Use the Master Theorem to solve this recurrence. (10 points) 2. Use the recursion tree to solve the recurrence. (15 points)