Insertion$-$Sort $($A$,$ n$)$

for $i=2$ to $n$

key$=A[i]$

$//$Insert $A[i]$ into the sorted subarray $A[1$:$i-1]$

$j=i-1$

while $j>0$ and $A[j]>$key

$A[j+1]=A[j]$

$j=j-1$

$A[j+1]=$ key

Let array $B=($:$1,2,3,4,5,6,7,8,9,10$:$).$

How many times do we execute line $5$ to sort the above array B using an insertion sort?