Find the complexity $($Exact and approximate$)$ for the basic operations of the following algorithms:

int Fun$2($int n$)$

$\{$

if $($n $<=0)$

return $1$;

for $($int i$=0$;i