I know the same question has already been posted and answered but it was answered wrong. Please show me the answer step

[answerhappygod]

I know the same question has already been posted
and answered but it was answered wrong. Please show me the
answer step by step. Thank you.

I Know The Same Question Has Already Been Posted And Answered But It Was Answered Wrong Please Show Me The Answer Step 1 (123.41 KiB) Viewed 23 times

PYTHON PROGRAMMING Problem 1 A) Use the Master's Theorem to design a function (it can do anything you want it to) that has an O(n1.6...) complexity. The first two digits should be 1.6 Note: We usually classify the complexity of our algorithms using common Big 0 sets such as O(n), O(n), O(n log n). However, for o this exercise, we will use the Big O set the master's theorem gives. Hint: You may want to use binary() (used as a recursion) as a starting point. Explain your thought process. n T(n) =a x T (7) + f(n) 1. if O(f(n)) < nlog, a, then O(T(n)) = nlog, a 2. if O(f(n)) = nlog, a, then O(T(n)) = nlogga lg n 3. if O(f(n)) > nlog, a, then O(T(n)) = (f(n)) = = B) Without changing the constant “a” and the “f(n)" you used in the master's theorem equation, use the function you made for the previous subquestion to design a O(n2.6...) algorithm. Hint. Use the function as a blackbox function within another function.