Determine the function for the number of steps taken by the algorithm. (FOR EACH FUNCTION)Which Big-O set will this algorithm belong to? In other words, determine the complexity of this algorithm...

Determine the function for the number of steps taken by the algorithm. (FOR EACH FUNCTION)
Which Big-O set will this algorithm belong to? In other words, determine the complexity of this algorithm

Because n usually refers to the size of the input, you can assume it is a positive integer.

Extracted text: def function1(y): X = y y = 1 x = x/x x = x/10 for i in range (int(x/2)): print("n") def function2(y): for i in range(y): for j in range(y): X = 1 print(n) X = 2 X = 3