Compress string B = wzzzzttwwqqzhhhzzhhhozztooozooth using the greedy algorithm HUFFMAN (C) as discussed in this module and required reading. Frequencies of characters within the string have already been counted:

w:3

z:10

t:4

q:2

h:7

o:6

List the code for the following letters in the boxes below.

w=

z=

t=

q=

h=