Python3 Problem: Determine corresponding order of growth (a-h), calculate the number of instructions in each line (SHOW YOUR WORK) and how you arrive at that conclusion.

Question 1.13. def someRecursiveFunc(m, n): fm--0 elif n0: lse: return n+1 return someRecursiveFunc(m - 1, 1) return someRecursiveFunc(m 1, someRecursiveFunc(m, n- 1)) Question 1.14. def func(n): sum0 for i in range(n) for j in range(n*n): return sum sum = sum +1 sum = sum + 2 Question 1.15. def fod(n): i=1 sum0 while i