Understanding the Huffman coding procedures in digital communication with examples

(20 pts.) Huffman Encoding. We use Huffman's algorithm to obtain an encoding of alphabet {a,b,c} with frequencies fa, fb, fc. In each of the following cases, either give an example of a specific set of frequencies fa, fb, fc that would yield the specified encoding or explain why the code cannot possibly be obtained.(a) {1,01,00}(b) {1,01,10}(c) {01,10,11}

We use Huffman's algorithm to obtain an encoding of alphabet {a, b, c} with frequencies fa, fb, fc. In each of the following cases, either give an example of frequencies (fa, fb, fc) that would yield the specified code, or explain why the code cannot possibly be obtained (no matter what the frequencies are (a) Code: {0,10,11} (b) Code: {0,1,00} (c) Code: {10,01,00} | Numerade