Example: Huffman's greedy algorithm uses a table giving how often each character occurs (i.e., its frequency) to build up an optimal way of representing each character as a binary string. Suppose we have a 100,000-character data file that we wish to store compactly. We observe that the characters in the file occur with the frequencies given by following table. That is, only 6 different characters appear, and the character a occurs 45,000 times. a b C d e f 16 Characters Frequency (in thousand) 45