Consider the code segment below, where arr is a one$-$dimensional array of integers.

int sum $=0$;

for $($int n : arr$)$

$\{$

sum $=$ sum $+2*$ n;

$\}$

System.out.print$($sum$)$;

Which of the following code segments will produce the same output as the code segment above?

Responses

int sum $=0$;

for $($int k $=0$; k $<$ arr.length; k$++)$

$\{$

sum $=$ sum $+2*$ k;

$\}$

System.out.print$($sum$)$;

int sum $=0$; for $($int k $=0$; k $<$ arr.length; k$++)\{$ sum $=$ sum $+2*$ k; $\}$ System.out.print$($sum$)$;

int sum $=0$;

for $($int k $=0$; k $<=$ arr.length; k$++)$

$\{$

sum $=$ sum $+2*$ k;

$\}$

System.out.print$($sum$)$;

int sum $=0$; for $($int k $=0$; k $<=$ arr.length; k$++)\{$ sum $=$ sum $+2*$ k; $\}$ System.out.print$($sum$)$;

int sum $=0$;

for $($int k $=1$; k $<=$ arr.length; k$++)$

$\{$

sum $=$ sum $+2*$ k;

$\}$

System.out.print$($sum$)$;

int sum $=0$; for $($int k $=1$; k $<=$ arr.length; k$++)\{$ sum $=$ sum $+2*$ k; $\}$ System.out.print$($sum$)$;

int sum $=0$;

for $($int k $=0$; k $<$ arr.length; k$++)$

$\{$

sum $=$ sum $+2*$ arr$[$k$]$;

$\}$

System.out.print$($sum$)$;

int sum $=0$; for $($int k $=0$; k $<$ arr.length; k$++)\{$ sum $=$ sum $+2*$ arr$[$k$]$; $\}$ System.out.print$($sum$)$;

int sum $=$ arr$[0]$;

for $($int k $=1$; k $<=$ arr.length; k$++)$

$\{$

sum $=$ sum $+2*$ arr$[$k$]$;

$\}$

System.out.print$($sum$)$;