CSC 311 Homewock 4A Spring 2019 180 Points Due THD Show all work for possible fall credit - answors only give you sero creditt Part A File commposaion methods Huffman Troe Part 1 Build a Hulfman troe from this dats: 130 Points 20 Points 10 Points B 0.25 D 0.35 E 0.10 R 0.10 Part 2 Using your tree from Part 1 (Huffman Tree); 10 Points 1) Show your compeessed data for this string: DOOROARBROADEER 2) Ditermine the namber of bits saved over using bytex for the criginal string LZV Part Compress this string ziven below and show both your dictionary and the final ccmmpurmond data 61 Points 15 Polnts Part 2 Compres this string given hiew and ehrw heth your dict inary aul lie ual erunpresad datK Part 3 2) Puists Decompress thi sacoeturse of snimbers aed show the devcompsend string aad the Saal dietionscy gives that yon linn A-1,B-2, C 3: 32113462859 I Points Fax Commpresion Given this stringofty, and 1x, slurw the 4-1iit nimpreso n. iho r.bit oimprovin, and that 6-1a onn- reion a demnetented in cleos [L0 points for eoch compressoon, 10 points oe shoving the number of Part B Etrot Detoctin/Errse Cucretice ie on the baeck sade