Complexity of Methods I

Consider this method:

int foo$($int $[]$ array$)\{$

int tmp $=$array$[]$;

for $($int $i=1$;$i$ array.length; $i++)\{$

if $($tmp $>$array$[i]$ tmp $=$array$[i]$;

$\}$

return tmp;

$\}$

What does it return?

The maximum value of an array

The index where the maximum value of the array is stored

The minimum value of an array

The index where the minimum value of the array is stored