Show all the steps of the adaptive Huffman tree construction for the following sequence: a,b,a,b,b,c,c Use the extended ASCII code (https://www.ascii-code.com/ Links to an external site.) to encode the first appearance of symbols. Write down the bit sequence of the code. Calculate the compression ratio. Conclude. Note: For fair grading: for each step of the tree construction or update please write the input symbol the output code, or if it is an update step, update 1, update 2, etc. if you show the last update it would be not sufficient.