$6$

In the following algorithm, which constant should be assigned to maximum to ensure that the algorithm finds the largest integer? $(2$ points$)$

int maximum $=$ constant $$;

for $($int current $=0$; current $$ numbers.length; current$++)$

$\{$

if $($maximum $$ numbers $[$current$])$

maximum $=$ numbers $[$current$]$;

$\}$

Select one:

a$.$ Int.MIN$\_$VALUE

b$.$ Int.MAX$\_$VALUE

c$.$ Integer.MAX$\_$VALUE

d$.$ Integer.MIN$\_$VALUE

Clear my choice