Write down the time complexity with a proper explanation of the following code segment.

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

{

if(builtin_popcount(i) == 2)

{

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

cout<

}

}

Note: builtin_popcount(i) returns the number of set bits in 'i'.

For example builtin_popcount(5) = 2. Because 5 = (101)2. So there are 2 set bits in 5.