Selection Sort$($A$)$

for i $=1$ to A$.$length $-1$

minIndex $=$ i

for j $=$ i $+1$ to A$.$length

if A$[$j$]<$ A$[$minIndex$]$

minIndex $=$ j

swap$($A$[$minIndex$],$ A$[$i$])$

If we sort an array A $=[1,2,3,4,5,6,7,8,9,10,11,12,13,14,15\}$ using the selection sort algorithm as specified above, how many time do we execute the body of line $4$ loop?