Lab 6 Greedy algorithms Write code for Huffman's algorithm (1)Tree representation(10%); (2)Constructing a Huffman code, HUFFMAN(C)(60%) (3)Document(including three complete use case).(30%) Note C denotes a set of n characters with the frequencies indicatedLab 6 Greedy algorithms. Write code for Huffman’s algorithm. (1) Tree representation (10%); (2) Constructing a Huffman code, HUFFMAN(C ) (60%); (3) Document (including three complete use case). (30%). Note. C denotes a set of n characters with the frequencies indicated