(ii) A CRC implementation uses a generating polynomial of the form G(x) = x + 1. The message polynomial before transmission is M(x) = x + x + x, determine the message length k, the codeword length n, and the binary form of the final transmitted message (hint: by dividing xn-kM(x) with G(x)). (iii) With regard to (ii), suppose the receive polynomial is Z(x) = x6 + x + 1. Using long division, show if the transmission suffers from an error or not.