Using polynomial notation, explain the principle of operation ofa cyclic redundancy check (CRC) error detection method by showing how the error detection bits are generated and the received frame is checked. \text { Consider the generator polynomial } x^{3}+x+1 Derive the check bits and the transmitted messages for-each of the following two messages: 101100 and 001111. ii) A code uses p(x)=x'+x* +1 as the generator polynomial. At the receiver the vectors 011111101 and 111001111 are-received. Determine whether or not an error is present. Assume the generator polynomial is p(x) =x' +x* +x+1, give the error patterns that can be detected and state why the CRCcode is generally used for error detection and not correction.