The best$-$case performance for an array of $n$ items using insertion sort is

$O(n^2)$

$O(nlogn)$

$O(n)$

$O(2^n)$

$O(1)$