Question 6 (20 points) Provide an optimal prefix code for a, d, e, m, n, r, t, u that occur with frequencies 56, 18, 94, 8, 34, 30, 73, 11 respectively. (Show all the steps for the Huffman tree.)