What is the time complexity of this pseudocode? for (int i = 1; i = 1) { Count < < j%2; j/=2; } Count <

What is the time complexity of this pseudocode?

for (int i = 1; i <= n; i++)

{

int j = n;

while (j >= 1)

{

Count << j%2;

j/=2;

}

Count << endl;

}

a) O(log(n))

b) O(n*n)

c) O(n*m)

d) O(n*log(n))

please respond with a,b,c or d as well. THANK YOU