Consider the following function ) : f n unsigned int (unsigned int )( b = 0

unsigned int ;
while (n) {
b+ = n&1
;
n ≫>= 1
;
}
return b;}
```
f (

The function ) returns the int that represents _P_ the in the binary representation of positive n P

integer , where is

1. Anumber of 0 's
2. Bnumber of bits
3. Cnumber of consecutive 1's
4. Dnumber of 1's

Pick an option to check yourself, or open the answer below.

Show answer & explanation

Correct answer: D. number of 1's

Explanation

b += n & 1; n >>= 1 adds each low bit and shifts: it counts the 1 bits.