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?