Could you please give an explanation for this too, Thank you.

Suppose we run a function with various input sizes, n, and we find it has the following actual runtimes, T(n), in seconds. What, then, is the big-oh runtime for this function? Use the empirical runtime analysis technique taught in class to show that your hypothesis about the big-oh runtime is correct. n | T(n) 100 | 10s 200 40s 500 250s 1000 1000s