Suppose you have analysed a file and determined that the frequency of occurrence of certain characters is as follows:

a$)$ Construct the Huffman tree for the characters

b$)$ List the codes for each character

c$)$ Use the tree to compress the following strings:

i$)$ 'faded'

ii$)$ 'feed'