What is the step count frequency of the following algorithm?

Algorithm Sum$($A$,$n$)$

$\{$

$s=0$;

for $s=s+A[i]n+32n+32n+2(i=0$;$i$

$\{$

$s=s+A[i]$;

$\}$

return $s$;

$\}$

$n$

$n+3$

$2n+3$

$2n+2$