Let C be a Huffman binary code for source with alphabet S = {s1, , sq}. The code words are w1, w2, , wq. Prove that the equality holds in Krafts inequality, i.e., X q k=1 1 2 lk = 1, where lk is the length of wk.

Let be a Huffman binary code for source with alphabet S = {s, . . . , sq). The code words are wi, w2,'.. ,wq. Prove that the equality holds in Kraft's inequality, i.e., -1 where lk is the length of wk. k-1