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

Please explain your reasoning in detail.

int total = 0;

for (int z = n; z > 0; z /= 2)

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

total++;

-------------------------------

int total = 0;

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

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

total++;

--------------------------------