Some$-$Algorithm$($A$)$

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

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

$3//$ Insert A$[$j$]$ into the sorted sequence A$[1...$ j $-1].$

$4$ i $=$ j $-1$

$5$ while i $>0$ and A$[$i$]<$ key

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

$7$ i $=$ i $-1$

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

If you run Some$-$algorithm on A $=\{1,2,3,4,5,6,7,8,9,10\},$ how many time does line $6$ and $7$ will be executed?