Give a big-Oh characterization, in terms of n, of the running time of the example5 function shown in the following Code Fragment

def example5(A, B) # assume that A and B have equal length 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 n-l total = 0 for j in range(n) #loop from 0 to n-l # loop from 0 to j for k in range( 1+j): total += A[k] if total: count += 1 return count