Python:

1. 120pts]: For each of the following pieces of code, write down the time complexity that the code will run in, choosing from 0(1), 0(log n), 0(n), 0(n log n), 0(n), 0(n): for i in range (n): for i in range (10): for j in range (n): 1t_2 for j in range (n): print (i-j) print (i * j) Big-O: Big-O: for i in range (n): for i in range (521313 2213*11) for j in range (n, n/3, -9) for j in range(i **i**i): for y in range(j *i): for k in range (n): return n print(i, j, y) Big-O: Big-O