a) Compute the entropy of the source whose symbol probabilities are defined as above in the table.

b) Construct a Huffman-code for the source symbols r_k and explain the differences between this code and code 2 from the table.

c) Construct the best B₁code for this distribution.

d) Construct the 2-bit binary shift code.

e) Divide the symbols into two blocks of four and construct the best Huffman shift code.

f) Compute the average word lenghts for each code and compare them to the entropy from part a).

P(rk) Code1 Code 2 2(k) 0.25 01010111 0.4710000000 0.25 11000100 87 -. 01 87 r128 = 128 s6 186 255 255 rk fork 87, 128, 186, 255 001 0 P(rk) Code1 Code 2 2(k) 0.25 01010111 0.4710000000 0.25 11000100 87 -. 01 87 r128 = 128 s6 186 255 255 rk fork 87, 128, 186, 255 001 0