Zippity the robot speaks a language of \(n\) words which can be written with \(0\)s and \(1\)s. In this language, no word appears as the first several digits of another word. For example: if “\(1001\)” is a word, then “\(100101\)” can’t be a word. Show that if \(\ell_1,\cdots, \ell_n\) are the lengths of each word (i.e: the number of digits), then \[\frac{1}{2^{\ell_1}}+\frac{1}{2^{\ell_2}}+\cdots + \frac{1}{2^{\ell_n}}\leq 1.\]