Time complexity logarithmic

Question

for(i = 1; i < n; i *= 2) {
    sum++;
    for(j = 0; j < n; j += 2)
        total++;
}

Time complexity:

O(log(n))
O(log(n))
O(n)*O(log(n))
O(n)*O(log(n))

So final answer is: O(log(n))

Is this correct?

Answer 1

the complexity will be something like this :

O(lgN)
    O(1)
    O(N/2) == O(N)
         O(1)

so the complexity is :

this is the final answer O(lgN)*(O(1) + O(N)*O(1))

O(N)*O(1) = O(N) (1)

O(N)+O(1) = O(N) (2) because O(N) is bigger than O(1)

assuming (1) & (2) the final answer will be O(lgN)*O(N) = O(N lgN)

Answer 2

The complexity is: O(n) * O(lg(n))