Select the best answer.

Examine the following pseudocode. Each line is numbered $($leftmost number$).$

We are interested in the number of additions performed. Line $3$ performs additions.

Procedure$($A$)$

$n=A.$ length

$a=A[1]$

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

if $a=A[j]n+1n-2n-1$