H$"$If algorithm number $1$ uses

O$($n$^(2))$

LOps and algorithm number $2$ uses

O$($n$^(3))$

LOps, it means that $...$

$...$ algorithm $1$ necessarily is faster than algorithm $2$ even for small values of n$.$

$...$ algorithm $1$ is significantly faster than algorithm $2$ as n approaches

infinity.

$...$ algorithm $1$ and algorithm $2$ necessarily use approximately the same number of LOps for small

values of n$.$

$...$ algorithm $1$ is only marginally faster than algorithm $2$ as n approaches infinity." Which of these options is correct?