python language

2. Give a big-Oh characterization, in terms of n, of the running time for the following functions: A. [ 3 Marks] def example4(S): "m" Return the sum of the prefix sums of sequence S."n" n=len(S)prefix=0total=0forjinrange(n):prefix+S[j]total+prefix return total B. def examples(A, B): A assume that A and B have equal length "m"' Return the number of elements in B equal to the sum of prefix sums in A."." n=len(A)count=0 for i in range(n): \# loop from 0 to n1 total=0forjinrange(n):#loopfrom0ton1forkinrange(1+j):#loopfrom0tojtotal+=A[k] if B[i]== total: return count