Run the Huffman coding algorithm on the following input:   Alphabet C = {p, r, a, i, s, e, d}, with   frequencies f as percentages= {12, 16, 16, 12, 16, 16, 12}.   Draw the optimal coding tree and the (weighted) average code length.   Show the steps.  Write the codes for "paradise" and "airspeed".