The best$-$time complexity for insertion sort is $\_\_\_\_\_\_\_\_.$

Group of answer choices

O$($n$)$

O$(1)$

O$($nlogn$)$

O$($n$*$n$)$

O$($logn$)$