The best case time complexity of sorting an array containing N elements with insertion sort is $\_\_\_\_\_\_\_\_\_.$

Group of answer choices

O$($logN$)$

O$(1)$

O$($N$2)$

O$($N$)$