I think this solution is incorrect

question a: (7 + + 5 15 pts.) You are given the following text file containing letters B, C, D, and E. i. Construct an optimal prefix code called Huffman code for the above (see lelfrtg many bits do ou need to re resen e above file if ou repr n e rsi 04th coding ? iii. Suppose that we modified Line 6 of the Huffman Coding algorithm in the Appendix as: right tzl y EXTRACT-MAX(Q) Redraw only the ptimal co t tree for the modified algorithm. TIVO