Exercise $3$: Hamming Weight

The Hamming Weight of a binary number $n$ is the number of bits set to $1$ in the binary representation of $n.$ For example, the Hamming Weight of $14$ is $3,$ since

$14={1110}_2$

Give a divide and conquer algorithm to compute the Hamming Weight of a non$-$negative integer $n.$