z1=2, z2=3, z3=3, z4=0, z5=7, z6=3

Find an optimal Huffman code for the following set of frequencies: Character a Frequency 21 2*2233 24 225 3 * 26 Use your Z number 212223 4 26272s to fill-out the values in the table. If any digit in your Z number is equal to zero, then substitute it by 6 Use the algorithm learned in class .(6 pts) Draw the resulting Huffman tree. (2 pts) Write the binary codeword of each character. (2 pts) Encode the sequence "final