Select the best case scenario$($s$)$ for insertion sort regarding runtime of the algorithm.

InsertionSort$($a$[])$

$\{$

int $N=$ size;

for $($int $j=i$;$j>0$;$j--a[j-1]swap(a,j,j-1)$;NNNNi$=0$;$i$