$1.$ Huffman Code$/$bit representation Table of AAAAAABBCCDDEEFFFFF.

a$)$ Fix bit representation $($points: $1)$

b$)$ Variable bit representation $($points: $1)$

$2.$ Huffman Tree of AAAAAABBCCDDEEFFFFF $($You must use a software to draw the tree i$.$e$.$ MS word, Visio etc. Do not hand draw the tree$)$

a$)$ Fix bit representation $($points: $0\mathrm{.}2)$

b$)$ Variable bit representation $($points: $0\mathrm{.}3)$

c$)$ Highlight which Huffman bit representation require less bits for encoding i$.$e$.$ Fix bit representation or variable bit representation,

just like in lecture slides

Note: Fix bit representation depends on number the characters

a$)3$ bits can represent $8$ characters, $4$ bit can represent $16$ characters

b$)$ If you have more then $8$ characters use $4$ bit representation. You do not need to use all the bits i$.$e$.$ you can use $4$ bits to represent $9$

characters.