Consider the method seqSearch, which implements a sequential search algorithm.

public int seqSearch$($int$[]$ arr, int target$)$

$\{$

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

$\{$

if $($arr$[$j$]==$ target$)$

$\{$

return j;

$\}$

$\}$

return $-1$;

$\}$

Consider another method, seqSearch$2,$ which modifies seqSearch to use an enhanced for loop.

public int seqSearch$2($int$[]$ arr, int target$)$

$\{$

for $($int j : arr$)$

$\{$

if $($j $==$ target$)$

$\{$

return j;

$\}$

$\}$

return $-1$;

$\}$

Which of the following best describes the difference in the behavior of seqSearch$2$ relative to seqSearch as a result of the modification?

A$.$ The modification in seqSearch$2$ has no effect: seqSearch$2$ will always behave exactly as seqSearch does.

B$.$ The modification in seqSearch$2$ will cause a compilation error.

C$.$ The modification in seqSearch$2$ will cause an ArrayIndexOutOfBoundsException to be thrown for some inputs.

D$.$ The modification in seqSearch$2$ will cause $-1$ to be returned for all inputs.

E$.$ The modification in seqSearch$2$ will cause the value of target to be returned instead of the index of target in cases where target appears in arr.