please slove 2,3

Q 2. Recursive Algorithms (20%) (1) What will be the output of the following Python code? [5%) def test(i, j): if i 0 (3) Write a recurrence equation that expresses the space complexity of the following function. [5%] def f(n): if n == 0: return 1 else: Allocate n units of memory return f(n-1) If the memory allocated is not released until the program ends, give the recurrence equation that expresses the units of memory allocated when f(n) is called and thus gives f(n)'s space complexity 0 Tw) ={9 n=0 n>0