1. Huffman coding is prominent type of compression generating variable length codes for different symbols. Huffman compression is performed by constructing a binary tree using a simple example set by arranging the symbols of the alphabets. By using your full name as the string, encode and perform the Huffman coding. Also, provide a complete binary tree and table. Example: ABU BIN RAHMAT or RAVI A/L RAMASAMY (without BIN, BINTI, A/L and A/P).