I need a thorough and valid proof of #3

| Assignment#2.pdf Algorithm Design.pdf (- 0 O file:///C/Users/Salah/Downloads/Assignment#2.pdf Find on page huffman No results Options 2 of 3 implement the Huffman algorithm in linear time 3. More Huffman Codes (a) Let A be an alphabet with n > 3 letters. Assume every letteri E A has a frequency with probability fi Prove that the Huffman algorithm will encode every letter using at least two bits (b) Let A be an alphabet where every frequency probability is a power of two That is, for each letter i E A we have f 211 for some non-negative integer n,. Prove that the Huffman algorithm will encode letter i using exactly n, bits 2Ti 4. Cycle Hitting Sets 12:01 AM O Type here to search t ENG 2019-02-15 | Assignment#2.pdf Algorithm Design.pdf (- 0 O file:///C/Users/Salah/Downloads/Assignment#2.pdf Find on page huffman No results Options 2 of 3 implement the Huffman algorithm in linear time 3. More Huffman Codes (a) Let A be an alphabet with n > 3 letters. Assume every letteri E A has a frequency with probability fi Prove that the Huffman algorithm will encode every letter using at least two bits (b) Let A be an alphabet where every frequency probability is a power of two That is, for each letter i E A we have f 211 for some non-negative integer n,. Prove that the Huffman algorithm will encode letter i using exactly n, bits 2Ti 4. Cycle Hitting Sets 12:01 AM O Type here to search t ENG 2019-02-15