Consider a three-symbols alphabet with the specified probability of assignment shown below: P(X) 0.70 0.25 0.05 a b b The table below lists input alphabet with six different binary code assignments. Symbol Code 1 Code 2 Code 3 00 00 0 11 01 1 11 10 Code 4 1 10 100 Code 5 1 01 11 Code 6 1 00 01 (a) Scan these codes and determine which codes are practical (can be used for data compression applica- tion). Justify your answers. (b) Design a Huffman code for the above three-symbols source alphabet shown above and find its code efficiency (i.e., compression efficiency). (c) Design a Shannon-Fano code for the above three-symbol source alphabet shown above and find its code efficiency. Compare it with your answer in part (b). (d) It is possible to employ the "code extension" (code concatenation) technique to achieve a greater com- pression ratio than the result you obtained in part (b). Determine the code efficiency for your improved source coding method as well as the variance of the code lengths for two distrinct Huffman codes.