(IC 4.6) Optimality of Huffman codes (part 1) - inverse ordering

We prove that Huffman codes are optimal. In part 1, we show that the lengths are inversely ordered with the probabilities.
A playlist of these videos is available at:
• Information Theory