Insertion Sort $($A$)$

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

Key $=$ A$[$j$]//$insert A$[$j$]$ into the sorted sequence A$[1...$ j $1]$

i $=$ j $1$

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

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

i $=$ i $1$

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

If we used insertion sort to sort an array A$=\{1,2,3,4,5,6,7,8,9,10,11,12,13,14,15\},$ how many times do we execute line $6?$

Please count the number of times that we execute line $6.$