Consider a CRC code with a generator polynomial of g(x) = x + x + 1. (15 points) Show step by step (using longhand division) how to find the codeword that corresponds to information bits of 10001 (15 points) Show the shift-register circuit that implements this CRC code. (30 points) Suppose the codeword length is 10. Give three examples of undetectable errors for this CRC code, and justify your answers. i. An undetectable error burst of length 8; ii. An undetectable error burst of length 6; ii. An undetectable 6-bit error. a. b. c