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

---------for (int j = 0; j < i; j = j+2)

---------------Sum[i] += j * Sum[i];


What is the tight bound big-Oh time complexity in terms of n in each case? Show
all necessary steps.


(I GET IT THE OUTER LOOP IS log(n), BUT I'M CONFUSED ABOUT THE INNER AND THE TOTAL)