4. Algorithm analysis (lopta) Student ID: 23385 Algorithm 1 Magic mystery 1: function MA 2 if n-0 then IC-My STERY ,) where z is a coestant and n is integer 3; return 1 5: if n is even then 7: else 8:return val val return val val In plain terms, explain what the output of this algorithm is a. b. State the recurrence of this, and then solve for the asymptotic upper bound