CSC 311 Homework 4A Spring 2019 Show all work for possible full credit - answers only give you zero credit! 180 Points Due: TBD Part A File compression methods Huffman Tree Part 1 Build a Huffman tree from this data: 120 Points 20 Points 10 Points A = 0.15 B 0.25 D 0.35 E 0.10 O - 0.05 R 0.10 Part 2 Using your tree from Part 1 (Huffman Tree): 10 Points 1) Show your compressed data for this string: DOOROARBROADEER 2) Determine the number of bits saved over using bytes for the original string LZV Part 1 Compress this string given below and show both your dictionary and the final compressed data: 60 Points 15 Points CBACBACBACBACBACBACBA Part 2 Compress this string given below and show both your dictionary and the final compressed data: 25 Points AAAAAABBBBBBCCCCCCAAAABBBBCCCCAABBCCABC Part 3 Decompress this sequence of numbers and show the decompassed string and the final dictionary given that you have A 1, B 2, C- 3: 3 21434628 59 20 Points 40 Points Fax Compression Given this string of O's and I's, show the 4-bit compression, the 5-bit compression, and the 6-bit com- pression as demonstrated in class (10 points for each compression, 10 points for showing the number of bits saved by each compression and which one has most bits saved for the original string) 10(31)11110(63)1110(15)110(127)10(255)1 Part B Error Detection/Error Correction is on the back side