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

def example4(S): Return the sum of the prefix sums of sequence S. n len(s) prefix = 0 total for j in range(n) prefix += S total += prefix return total