Python code to sort a list of numbers using insertion$-$sort algorithm is given. definsertion$\_$sort$($A$)$:

$"\text{'}"\text{'}$ Sort the elements of the list in ascending order"$\text{'}""$

for $k$ in $,$ len$($A$))$:

cur $=A[k]$

$j=k$

while $j>0$ and $A[j-1]>$ cur:

$A[j]=A[j-1]$

$j-=1$

$A[j]=$ cur

$A=[6,8,2,3,9,4,7,1]$

insertion$\_$sort$($A$)$

What will be the value of list $\text{'}A\text{'}$ after the for loop is run for two times?

a$)6,8,2,3,9,4,7,1$

b$)2,6,8,3,9,4,7,1$

c$)1,2,6,8,3,9,4,7$

d$)6,2,3,4,7,1,8,9$

$19.$ What will be the running time of the algorithm given below?

for $)=1$;$i**i$

printf$("\%dln",i*i)$

$(a$