Code in python please

[10 points] Problem 1 What is the recurrence equation that describes the running time of the following recursive function? T(n) = a Tn/b) +n^k. What are the values of a, b, and k? def f(a, n): # First call: f(a, len(a)) if ne: f(a, n // 2) f(a, n // 2) for i in range(len(a)): for j in range(len(a)): print(a[0]) [] def get_prob1_ans(): a = 0 b = 0 k = 0 return a, b, k