Please give the worst-case running time complexity!

lef series(n):n=2ntotal=0foriinrange(0,n):total+=iprint(total) peries (16) def conditional2 (items): if max(items) 2: flag = True else: flag = False return flag conditional2 ([1,2,3])