give the order of growth in big-o notation as a function of n.

Please explain your reasoning

int total = 0;

for ( int j = 1; j < k; j *= 2)

for (int r = 0; r< k; r++)

total++;