Time Complexity

Computer Science Level 2

What is the time complexity of the code below?

int count = 0;
        for (int i = N; i > 0; i /= 2) {
            for (int j = 0; j < i; j++) {
                count += 1;
            }
        }

Assume that arithmetic operations take constant time regardless of the size of the input.

\Theta(N^2)

\Theta(N\sqrt{N})

\Theta(N\lg N)

\Theta(N)

\Theta(N\lg (\lg N))