Question :
(a) With respect to Huffman Coding, devise a formula to compute the average compression based on the number of characters in a piece of text, n, and the number of unique characters in its alphabet, m.
(b) Does the "tree"'you produce during coding represent a topological sorting? Why or why not?