HUFFMAN CODING For these characters and their frequencies, draw a binary tree with characters as leaves and parent nodes as sum of daughter frequencies. From root, put 0 on left and 1 on right. Then from root to character get the code for that character. See examples in Course Materials. This does not involve any program. Please do this by hand. character k j n p e freqiency 2 4 5 7 12