Given the following program, calculate its asymptotic complexity $($Big$-$O$)$ in terms of n$.$ Show all your

work step$-$by$-$step as the examples provided in the class. Answer only without process receives half points.

$[3$ pts$]$

public static int function$($int$[]$ arr$)\{$

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

for $($int j$=0$; j $<$ n; j$++)$

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

return total;

$\}$