Question $5($Algorithms and Complexity$)$

Suppose that algorithm one has time complexity f$($n$)=500$n$^2$ and algorithm two has time complexity f$($n$)=$ n$^2.$ Which algorithm would you expect to be faster for large input?

A$)$ Algorithm one is faster.

B$)$ Algorithm two is faster.

C$)$ The two algorithms are equally fast.

D$)$ We cannot tell from the information given