The answer will be short answerumber, not code. Find the calculation of optimal path, and expected number of bits per letter

5.18. The following table gives the frequencies of the letters of the English language (including the blank for separating words) in a particular corpus. blank 18.3%| r 4.8%ly 1.6% 10.2%| d 3.5%| p 1.6% t 7.7% | 13.4% | b 1.3% 6.8%| 2.6%|v 0.9% 5.9%lu 2.4%| k 0.6% 5.8%1 m 2.1%| j 0.2% 5.5%| w 1.9% x 0.2% 5.1%| f 1.8%| q 0.1% | g 1.7%|z 0.1% 0 4.9% (a) What is the optimum Huffman encoding of this alphabet? (b) What is the expected number of bits per letter? 5.18. The following table gives the frequencies of the letters of the English language (including the blank for separating words) in a particular corpus. blank 18.3%| r 4.8%ly 1.6% 10.2%| d 3.5%| p 1.6% t 7.7% | 13.4% | b 1.3% 6.8%| 2.6%|v 0.9% 5.9%lu 2.4%| k 0.6% 5.8%1 m 2.1%| j 0.2% 5.5%| w 1.9% x 0.2% 5.1%| f 1.8%| q 0.1% | g 1.7%|z 0.1% 0 4.9% (a) What is the optimum Huffman encoding of this alphabet? (b) What is the expected number of bits per letter