. Consider the 8*8 image below, please create the Huffman code tree and show the Huffman code for each value. Please compute the compression ratio assuming that each value needs 3 bits using fixed-length code before Huffman compression. Please show detailed steps for full 0 0 0 0 1 3 5 7 0 0 0 0 1 3 5 7 0 0 0 0 1 3 5 7 0 0 0 0 1 3 10 5 7 1 1 1 1 1 3 5 7 222 2 1 3 5 7 4 4 4 4 1 3 5 7 6 6 6 6 1 3 5 7 credits. (Hint: calculate the frequency for each number in the image, and then apply Huffman coding)