For every integer $n \geqslant 1$, we denote $C_{n}$ the number of well-parenthesized words of length $2n$. We set by convenience $C_{0} = 1$.
Show that, for every natural integer $n$, $C_{n} \leqslant 2^{2n}$. What can we deduce for the radius of convergence of the power series $\sum C_{k} x^{k}$?