A binary linear cyclic block code with a code length of n=14 has the generator polynomial. g(x) = 1 + x2 + x| a) Determine the number of information and parity check bit bits for each code word. b) Draw the diagram of feedback shift register encoder for the Linear Cyclic code. c) Illustrate the encoding procedure with the message vector (11011110 ) by using the states of the register(the right most bit is the earliest bit) and obtain the final code word d) Devise a syndrome computation circuit for this code. Let r=[11010011001010 ] be a received vector. Compute the syndrome of r(t). Display the contents of the syndrome register after each digit of r has been shifted into the syndrome computation circuit. e) Verify the codeword obtained in part c polynomial division method f) Compare the syndrome computation performed part d by performing polynomial division method. Kindly. Solve this question with all steps and in clear line please. A binary linear cyclic block code with a code length of n=14 has the generator polynomial. g(x) = 1 + x2 + x| a) Determine the number of information and parity check bit bits for each code word. b) Draw the diagram of feedback shift register encoder for the Linear Cyclic code. c) Illustrate the encoding procedure with the message vector (11011110 ) by using the states of the register(the right most bit is the earliest bit) and obtain the final code word d) Devise a syndrome computation circuit for this code. Let r=[11010011001010 ] be a received vector. Compute the syndrome of r(t). Display the contents of the syndrome register after each digit of r has been shifted into the syndrome computation circuit. e) Verify the codeword obtained in part c polynomial division method f) Compare the syndrome computation performed part d by performing polynomial division method. Kindly. Solve this question with all steps and in clear line please