Analysis of Algorithm course

Please print or write neatly

4. Analysis: (20 points) 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 >1. Justify your answer by drawing a recursion tree to help your calculation as we have learned in the class. Appendix A may help your calculation if needed. 00 von A WNA Mystery(n) if n