Which of the answers describes best the worst$-$case run$-$time of Insertion Sort, for the size n of the array?

Omega$($n$^3)$

Omega$($n$^2$ log$($n$))$

O$($n$^3)$

Theta$($n log$($n$))$

O$($n$)$