write the exact and asymptotic time complexity for each algorithm $($write each time complexity for every line$)2)$ 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$--$;

$\}$

$\}$

$\}3)$ A loopwhere the loop variables is incremented $/$ decremented by a constant amount k$,$ as follows:

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

$//$ Here k is a positive integer constant

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

int a $=5$;

a$+=$i ;

$\}$

$\}$