Consider the following implementation of the insertion sort algorithm for an Array of doubles.

public static int insertSort$($double$[]$ arr$)\{$

int count $=0$;

for $($int i $=1$; i $<$ arr.length; i$++)\{$

double val $=$ arr$[$i$]$;

int j;

for $($j $=$ i $-1$; j $>=0$; j$--)\{$

count$++$;

if $($arr$[$j$]>$ val$)\{$

arr$[$j $+1]=$ arr$[$j$]$;

$\}$ else $\{$

break;

$\}$

$\}$

arr$[$j $+1]=$ val;

$\}$

return count;

$\}$

The method returns an int which represents a statement execution count. What will this value be when the method returns if the parameter list is the array $\{3\mathrm{.}3,4\mathrm{.}7,1\mathrm{.}2,4\mathrm{.}1\}$: