1. Suppose we have the following alphabet S = {a,b,c,d,e) and the following frequencies fa=0.26, = 0.24. 10.22la = 0.14, fe = 0.14. (a) Draw the prefix code (as a binary tree) returned by the Shannon-Fano algorithm. You must explain each step / show each intermediate subset of S that is created. (b) Draw the prefix code (as a binary tree) returned by Huffman's algorithm. You must show every alphabet and/or new meta-letter that is created, and you must show the "unrolling of the final binary tree. (c) Compute the ABL of the Huffman code found in the previous