Please Solve it very quickly, I will Be Thankful to you

Consider a convolutional code with generator matrix: GQ = (1 + ax?, 1 + x + x) a) Examine the shift register implementation of the encoder for a = 0. b) If Gm = (1 + x + x3 + x4 + x6,1 + x3 + x4 + x5 + mx?), Simplify the memory and the number of states for m=0. c) Consider a Hamming code with 4 input bits. Compare the code rate and fill the empty boxes in the Table for the given generator (G) and parity check matrix (H). 51101 1011 1000 0 0 0 111 1] G = 10111],H 0110011 0100 11 01010 1 0010 -0001 = y e No. of bit s i errors 1011 1110011