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

InsertionSort$($a$[])$

$\{$

int N $=$ size;

for $($int i $=0$; i $<$ N; i$++)$

for $($int j $=$ i; j $>0$; j$--)$

if $($less$($a$[$j$],$ a$[$j$-1]))$

swap$($a$,$ j$,$ j$-1)$;

else break;

$\}$

Question $6$ options:

N items in descending order

N all$-$same items

N items in ascending order

N all$-$negative items

N all$-$positive items