00:03
So first decode the bit string using given huffman code.
00:10
So the given huffman code is not provided, so we cannot decode the bit string using it.
00:16
Then construct an optional huffman code for a set of letters in the table.
00:29
To construct this, we need to follow the step, such as arrange the letters in descending order of their frequencies.
00:46
S, 27 .5, u, 25 .0, n, 20 .0, i, 13 .0, e, 10 .0, a, 7 .5, l, 7 .0, h, 2 .5, m, 2 .5, c, 2 .0, d, 1 .0.
01:05
Then combine two letters with lowest frequencies, and then create a new node with their combined frequency.
01:19
Combine m, 2 .5, c, 2 .0 to create a new code node with a frequency 4 .5.
01:28
Repeat step two until there is only one node left.
01:32
Combine h, d to create a new node with a frequency 3 .5, and combine a and l to create 12 .5.
01:42
Combine e and previous node to create 13 .5.
01:48
Combine i and previous node 13 .5 to create 26 .5.
01:54
Combine n and previous node to create 46 .5...