From your results of the previous question, what do you think are the conditions of the probability distribution which give rise to a high compression rate using Huffman coding? Download a Huffman...

From your results of the previous question, what do you think are the conditions of the probability distribution which give rise to a high compression rate using Huffman coding? Download a Huffman code program (or write one of your own), and test it on the examples given. Then try it on different images. What sort of compression rates do you obtain? What sorts of images seem to have the best compression rates? Note: Both Octave and MATLAB have Huffman routines in their Communications toolboxes; a Python routine can be found at http://rosettacode.org/wiki/Huffman_coding#Python.