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

for i $=1$ to n$-1$

for j $=1$ to n$-1$

if A$[$j$]>$ Array$[$j$+1]$

swap$($Array$[$j$],$ Array$[$j$+1])$

Let array B $=<1,2,3,4,5,6,7,8,9,10>.$

How many times do we execute line $3$ to sort the above array B using a bubble sort?