for each of the following recursive methods write a recurrence of the form T(n) = aT(f(n)) + g(n) to describe its running time. Assume all initial calls have the form f( a, len(a) -1) or f( a, 0, len(a) - 1)

def f1(a, n): ifn>0: for i in rangef Len(a)): printlali11) f1la, n-1) def f2(a, n): f n > 0: for i in range( Len(a)): print(ali]) 12(a, n // 2) def f3(a, n): ifn>0: f3(a, n // 2) def f4(a, n): ifn>0: for i in range(len(a)): print(ali]) f4(a, n /I 2) #4(a, n // 2) def f5(a, first, last): if first