Suppose a Huffman tree is to be built for 5 characters. Give a set of 5 characters, and their distinct probabilities (no duplicates), that would result in the tallest possible tree. Show the tree. Derive the average code length: write the expression, you don't have to simplify it down to a single value.