We define an enabled nibble as a 4-bit segment of 1s in an u…
We define an enabled nibble as a 4-bit segment of 1s in an unsigned 32 bit integer. Write a function int countEnabledNibbles(unsigned int n) that counts the number of non-overlapping enabled nibbles of an unsigned 32-bit integer. For example, the number 01111000 has 1 enabled nibble. The number 111111111 has 2 enabled nibbles. The number 11001100 has 0 enabled nibbles. The number 11110000111111110000110011000000 has 3 enabled nibbles. The number 01111111111111111111111111100000 has 6 enabled nibbles. The number 10101010101010101010101010101010 has 0 enabled nibbles. Examples countEnabledNibbles(120) -> 1 // (120)10 = (01111000)2 countEnabledNibbles(511) -> 2 // (511)10 = (111111111)2 countEnabledNibbles(204) -> 0 // (120)10 = (11001100)2