Question

1. Use the substitution method to show that the recurrence T(n) = √ n T( √ n) + n has solution T(n) = O(n lg lg n). 2. Determine the Theta-Bounds of the following functions by using method of your choice: I. f(n) = n + n 2 + 2n + n 4 II. f(n) = (log n) 2 + 2n + 4n + log n + 50 III. f(n) = (n2 + 3)(n+1)

Answer 1

For this answer download the app *maths solver microsoft* you can scan your any question
Hope this will help you please mark me as brainliest