$1.$ A loop or recursion that runs a constant number of times, such as follows:

Fun$($int array A of size n$)\{$

for $($int i $=1$ to k$)\{//$ Here k is a constant, it could be any constant number

for $($int j $=1$ to k$)$

$\{$

int a $=5$;

a$++$;

a$--$;

$\}$

$\}\}$

what is the time complexity of this algorithm