Consider a recursive function that will calculate and return the sum of bits in an integer decimal number $($the input argument$).$ For example, we know that $14$ in decimal is $1110$ in binary. The sum of the bits is $3.$ Note that the bits are obtained using synthetic floor division by $2$ and modulus $2$ arithmetic. For the example, start with the quotient $q=14.$

The rightmost bit is obtained by $q\%2=14\%2=0$

Recalculate the new quotient as $q=\frac{q}{\frac{?}{?}}2=\frac{14}{\frac{?}{?}}2=7$

Next bit is $9\%2=7\%2=1$

next quotient $q=\frac{q}{\frac{?}{?}}2=\frac{7}{\frac{?}{?}}2=3$

next bit is $q\%2=3\%2=1$

next quotient $q=\frac{q}{\frac{?}{?}}2=\frac{3}{\frac{?}{?}}2=1$

next bit is $q\%2=1\%3=1$

next quotient $q=\frac{q}{\frac{?}{?}}2=\frac{1}{\frac{?}{?}}2=0($base case$)$

Complete the following code:

def recur$($n$)$:

return $0$

else: