Five (5) points each:

(1) What is the computational complexity of converting a text file
    into compressed form using Huffman coding?  Include creating the
    Huffman tree in the cost calculation.  Define all variables (e.g.,
    for the number of words in the text file) required to completely
    characterize the complexity.

(2) Explain the relative advantages and disadvantages of writing the
    Huffman tree in the compressed file header as opposed to writing
    the raw character frequencies.  Be brief.