Huffman Encoding questions?
===

These are some practice problems from my study guide for my upcoming test regarding Huffman Encoding and I can't seem to understand them, could anyone please help?

You are given a DNA sequence of length n, which contains close to an equal 
amount of { A, C, G, T } characters. What is the amount of compression you 
would be able to achieve as a function of n. For example, if a 10,000 length
sequence is represented with 10,000 bytes, how many bytes would the encoded
sequence require?

Assume you want to send a lot of text over the Internet and plan to use Huffman
encoding to reduce the the number of bytes sent. Other than the data what would
you send across the network other than compressed data? Byte table? Frequency 
table? The trie? A file containing the original text? Something else...? 

Describe the difference between Huffman Encoding and Patricia encoding. 
Specifically what is the difference in inputs each each takes? And what is at 
least one real world application where each could be used?

What is the range of lengths that a character encoding can have? Can a character
be represented with 0 bits? 1 bit? 3 bits? ... 10 bits? 
