Project Description Algorithm Design Source Code Output (Screen Shots) Result Analysis D e Data Structure Project 3: Huffman Coding Huffman coding uses a specific method for choosing the representation for each symbol, resulting in a prefix code (sometimes called "prefix-free codes", that is, the bit string representing some particular symbol is never a prefix of the bit string representing any other symbol). Huffman coding is such a widespread method for creating prefix codes that the term "Huffman code" is widely used as a synonym for "prefix code" even when such a code is not produced by Huffman's algorithm. Please write a C program to implement Huffman coding algorithm. Suppose the characters and weights are as follows: (a, 45) (6, 13) (e, 12) (d. 16) (e, 9) (1,5) Source Code for Reference #include #define MAXCHAR 100 typedef struct huffman_tree_node int weight, Ichild, child,parent: HTNODE HTNODE create huffman tree(int n, int weight(1) HTNODE"htree-NULL; int ij,mini, min2.n_nodes; n_nodes-2-1: htree-(HTNODE*)malloc(n_nodes sizeof(HTNODE)); for(i=0; i for(in; in_nodes; i++){ for(-0; j if(htreet parent-1) mini-j; break; I for(-0.jj++) if[htreel parental && trei weightstreemin 1].weight)minlaj: for-0:16:++) ifhtreel parent1 &&j-minl) { min2-j; break; 1 for(j 0; j<_nodes>