Time Complexity Question

I have a question about time complexity. Suppose you write a function that has O(N^2) time complexity. If we have a for loop in the main function that runs N times and contains the previous function, will the time complexity of that loop be O(N) or will it be O(N^3)?

It’d be O(N^3) because you run an O(N^2) function N times which is basically N^2 * N or N^3.

Oh ok thank you. I was just slightly confused about that.