Assignment 9       Due: Thursday, March 20th at beginning of tutorial


Consider your essay for assignment 3 (concerning digital vs analogue
computing). Ignore capitalization and consider all "white space"
as a single occurence of a single "blank character". Then for each character
in your essay, count the number of occurences. Use this count (or
the frequency of the characters) to construct an optimal
(Huffman) prefix tree. Compute the average length of a code word
and compare that to log_2 (#distinct characters) which
is the average number of bits needed to encode each character if
all characters occured with equal frequency. 

Here is what is required:

- the character counts (as a table)
- the optimal Huffman tree
- the codes for each character (as a table)
- the comparison (and calculations) for expected code length vs.
log(#chars)