Write the Big-O notation next to the function for each subquestion below
a. # Assume s is a string with n characters def f(s): if S==n": return nn prints[:lens)//2]) return f(s[:lens//2]
b. # Assume s is a string with n characters def f(s): x= len(s) y=s while x > 0: s=Y while len(s) > O: s=s[:lens//2] x=x-1
d. # Assume aList is list containing n items def f(aList): for i in range(len(aList)-l, O, -2): for j in range(i): print(i, j)
C. # Assume n is a positive integer def f(n): for i in range(n): print(i) for j in range(n) print(j) for k in range(l0: print(k)
e. # Assume n is a positive integer def f(n): if n< 500: return f(n*3) else: return 0