Consider the following algorithm, where the array A is indexed 1 through n. What is the time complexity T(n) for the following algorithm? Show all the required steps and do not present only the result.

int add_them ( int n , int A[ ] ) {

index i , j , k ;

j = 0 ;

for ( i = 1 ; i <= n ; i++){

j = j + A[i] ;

}

k = 1 ;

for ( i = 1 ; i <= n ; i++){

k = k + k ;

}

return j + k ;

}

im confused on wether the value of k matters or just simply the number of iterations.