Consider the Question of Whether It Is True That the Size

Essay

Consider the question of whether it is true that the size of the Huffman code of a symbol $a_{i}$ with probability $p_{i}$ is always less than or equal to $\left\lceil-\log p_{i}\right\rceil$ .
As a counter example, let the source alphabet be $\{=a, b\}$ . Given $p(a)$ and $p(b)$ , construct a Huffman tree. Will the tree be different for different values for $p(a)$ and $p(b)$ ? What conclusion can you draw?