Consider a Huffman’s Algorithm that uses a variable-length encoding scheme to compress the original text: BIRTHDAY to determine the following? 10 marks
i. Code tree
ii. Codeword
iii. Average code length