The following character and frequency table is to be used to create Huffman codes. a 10 b 5 c 8 d 2 e 14 a) Show the heap that results from inserting these character frequency combinations into the appropriate heap for the Huffman algorithm (10 points) b) Give the codes for each letter that result from running the Huffman algorithm in the heap of part a) (Create the Huffman Tree and traverse it to obtain the codes.)