There is a mystery function called Mystery (n) and the pseudocode of the algorithm is shown...

Transcribed Image Text:

There is a mystery function called Mystery (n) and the pseudocode of the algorithm is shown as below. Please analyze the worst- case asymptotic execution time of this algorithm using the method we learn in the class. Express the execution time as a function of the input value n. Assume that n = 3k for some positive integer k 21. Justify your answer. Hint: (a) Draw a recursion tree to help with your analysis. (b) Appendix A may help with your calculation 1 8678AWN1 2 3 4 5 8 Mystery (n) if ns1 return 1 for i=1 to n for j = 1 to 100 print "this is a recursive call." Mystery (n/3) Mystery (n/3) Mystery (n/3) There is a mystery function called Mystery (n) and the pseudocode of the algorithm is shown as below. Please analyze the worst- case asymptotic execution time of this algorithm using the method we learn in the class. Express the execution time as a function of the input value n. Assume that n = 3k for some positive integer k 21. Justify your answer. Hint: (a) Draw a recursion tree to help with your analysis. (b) Appendix A may help with your calculation 1 8678AWN1 2 3 4 5 8 Mystery (n) if ns1 return 1 for i=1 to n for j = 1 to 100 print "this is a recursive call." Mystery (n/3) Mystery (n/3) Mystery (n/3)