B$)$ Construct an optimal Huffman code for the set of letters in the following, and ENCODE them

$1)$ MISSISSIPPI RIVER

$2)$ MATHEMATICS BOOK

$3)$ IEEE COMMITTEE

C$)$ USE THIS HOFFMAN TREE BELOW TO DECODE

i$)01010000111$

ii$)1010001100111000$