2. Pseudocode Analysis (25 points) For the pseudocode below for procedure Mystery(n), derive tight upper and lower bounds on its asymptotic worst-case running time f (n). That is, for the set of inputs including those that force Mystery to work its hardest, find g (n) such that f(n) E (g(n)). Assume that the input n is a positive integer. Justify your answer. Mystery (n) 1. if n is an even number 2. for i= 1 to n 3. 4. 5. else 6, for k=1 to n/4 7. 8. for j-n downto n/2 print "even number" for m=1 to n print "odd number