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=($:$10,9,8,7,6,5,4,3,2,1$:$).$

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