Discuss if the following two versions of insertionSort are stable or not.

INSERTION$-$SORT$($A$)$

e for $j=2$ to A$.$length

INSERTION$-$SORT$($A$)$

key$=$A$[$i$]$

for $j=2$ to A$.$length

$i=j-1$

$x^{\text{c}\text{i}\text{v}\text{e}\text{r}}$

key$=$A$[$j$]$

$i=j-1$

$$ while$($i$>0$ and A$($i$]>$key$)$

$A[i+1]=A[i]$

$i=i-1$

$A[i+1]=A[i]$

$A[i+1]$~~ key

$i=i-1$

$A(i+1]=$key

solve it