What is the time complexity of the following function?

int func $($int arr$[],$ int n$)//$ n is the size of arr

$\{$

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

for $($int i $=1$; i $<$ n; $++$i$)$

if $($r $<$ arr$[$i$])$

r $=$ arr$[$i$]$;

return r;

$\}$

Group of answer choices

O$($n$2)$

O$(1)$

O$($n$)$

O$($logn$)$