The best asymptotically tight bound for insertion sort is $q,$

$q,$

$O(n)$

$O(logn)$

$O(nlogn)$

$O(n^2)$