Solution (source code)

= Solution

\b[False.] For probabilities $(0.4,0.2,0.2,0.1,0.1)$, first merge the two $0.1$ symbols. Subsequent ties allow Huffman trees with length multisets $(2,2,2,3,3)$ and $(1,3,3,3,3)$, both of expected length $2.2$.