4. (Basic) Assume the following when executing the Huffman algorithm: When combining two trees, the tree with lowest root frequency becomes the left child and the tree with the second-lowest root frequency becomes the right child. Left children are associated with the bit 0, right children with the bit 1.Run the Huffman's algorithm on the following input: a : 3. b:2. c: 4. d : 8. e : 7, f: 14. What is the codeword for each character? Give a tree representation