For all rational $x$ satisfying $0 \leq x < 1$, the functions $f$ is defined by \[f(x)=\begin{cases}\frac{f(2x)}{4},&\mbox{for }0 \leq x < \frac 12,\\ \frac 34+ \frac{f(2x - 1)}{4}, & \mbox{for } \frac 12 \leq x < 1.\end{cases}\] Given that $x = 0.b_1b_2b_3 \cdots $ is the binary representation of $x$, find, with proof, $f(x)$.

Let $ \alpha(n)$ be the number of digits equal to one in the binary representation of a positive integer $ n.$ Prove that: (a) the inequality $ \alpha(n) (n^2 ) \leq \frac{1}{2} \alpha(n)(\alpha(n) + 1)$ holds; (b) the above inequality is an equality for infinitely many positive integers, and (c) there exists a sequence $ (n_i )^{\infty}_1$ such that $ \frac{\alpha ( n^2_i )}{\alpha (n_i }$ goes to zero as $ i$ goes to $ \infty.$ [i]Alternative problem:[/i] Prove that there exists a sequence a sequence $ (n_i )^{\infty}_1$ such that $ \frac{\alpha ( n^2_i )}{\alpha (n_i )}$ (d) $ \infty;$ (e) an arbitrary real number $ \gamma \in (0,1)$; (f) an arbitrary real number $ \gamma \geq 0$; as $ i$ goes to $ \infty.$