For an input of size n$,$ let the running time of your algorithm is f$($n$).$ Then

which of the following are true? f$($n$)=$ n$^2+10^10$n f$($n$)=$ Omega$($n$)?$

f$($n$)=$ Omega$($n$^2)$