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

Omega$($n log n$)$

Theta$($n log n$)$

O$(2^$n$)$

O$(3^$n$)$