, determine the corresponding worst-case runtime complexity when called with an input list of size N. Assume the input list is a Python (array-backed) list.

def fB(M, N):

accum = 0

for i in range(1, M, M//10):

for j in range(1, N, N//10):

if i < j: accum += i

else: accum += j

return accum

def fC(lst):

N = len(lst)

accum = 0

if N < 100:

return 0

else:

for i in range(N * 10):

accum += i

return accum