5. The Huffman Encoding In 1951, while taking an Information Theory class as a student at MIT, David A. Huffman and his classmates were given a choice by the professor Robert M. Fano: they can either take the final exam, or if they want to opt out of it they need to find the most efficient binary code. Huffman took the road less traveled and the rest they say is history. Put simply, Huffman encoding takes in a text input and generates a binary code (a string of 0's and 1's) that represents that text. (10 points) Determine the Huffman code for the string: blablablaaaaabcde by building a Huffman coding tree. Your solution must show the Huffman tree and the corresponding Huffman code and % in savings