Consider the following segment of C code
int j, n;
j =1;
while $$(j \leq n)$$
j=j*2;
The number of comparisons madein the execution of the loop for any n > 0 is

A

$$[\log_{2} n ]*n$$

B

n

C

$$[\log_{2} n ]$$

D

$$[\log_{2} n ]+1$$