If an algorithm runs in quadratic time, what is its time complexity using Big$-$O$?$

Group of answer choices

O$($log n$)$

O$(1)$

O$($n$)$

O$($n$^2)$