What is the time complexity of the following method? public static int add$($int$[]$ arr$)\{$

int n $=$ arr.length, total $=0$;

for$($int i $=0$; i $<$ n; i $+=2)$

total $+=$ arr$[$i$]$;

return total;

$\}$