In verilog code

Problem 1 The following is the Huffman code of the source Alphabet= {a,b,c,d,e,f,g,h): e 00 h01 a 100 b 101 c 1100 d 11010 g 110111 f 110110 Using Girod's method in hardware, a) Show bit by bit using shift and XOR operations generation of C for the sequence "bad", and decoding in the forward direction. b) Show all the steps of decoding in reverse direction of the following sequence, c= 1101000011010011011. What is the retrieved string