Part of an image (or a message) consists of the following sequence of pixel values 56784372349767773582792223334443 33444 666 12 17 192121 a) (2 pts) Determine the histogram of this message. b) B pts) Devise a Huffiman code for this sequence. c) (3 pts) What is the compression ratio you can achieve for this entire message by using the Huffman code as compared to the regular 5 bit code that would be required to include numbers up to 19? d) (3 pts) Does the Huffimann coding result in a lossless or a lossy compression? e) (3 pts) What is the theoretical minimum number of bits required to code this message? f) (3 pts) What is the ratio of your code to the theoretical minimum? g) (3 pts) Use Huffman coding for the ten most probable numbers and regular coding for the rest. Is the compression achieved better than that of part (b) above