(seed = 540634)
Compute the Huffman trie for the following string of length 46?
XXWBHWBBWYOOBVWWXVYXWBBWVOWOBWHXXHBBWOBVBBXBWX
For reference, here are the frequencies of each of the characters in the string:
char freq
----------
B 13
H 3
O 5
V 4
W 11
X 8
Y 2
Using the encodings from the Huffman trie you computed, how many bits are needed
to encode the above string? Do not count the bits to represent the encoding table
or any bits used for padding and byte alignment.