Worst$-$case complexity of insertion sort algorithm is

Group of answer choices $1)$ O$($n$^2)2)$ O$($n$.$logn$)3)$ O$($n$)$