What is the optimal Huffman code for the following set of frequencies?

CharacteralipnecFrequency$5162183116$

Use the algorithm learned in class to answer the following questions.$$

$(5$ pts$)$ Draw the resulting Huffman tree

$(2$ pts$)$ Write the binary codeword of each character

$(2$ pts$)$ Encode the sequence $$nice$$

$(1$ pt$)$ Compute the file length.