Suppose we have a message m = 0101011010100001 to be transmitted across a network and to protect it from errors, we use the CRC generator polynomial P(x) = x^7 +x^6 +x^2 +x. Answer the following: (a) What is the CRC generator sequence? (b) How many bits long is the resulting Frame Check Sequence (FCS)? (c) What is the actual transmitted bit sequence including the CRC? (d) How large of a burst of errors can be detected?

6 (5 pts) Suppose we have a message m 01010110101 00001 to be transmitted across a network and to protect it from errors, we use the CRC generator polynomial P(z) z7 r6 +r2 +r. Answer the following (a) What is the CRC generator sequence? (b) How many bits long is the resulting Frame Check Sequence (FCS)? (c) What is the actual transmitted bit sequence including the CRC? (d) How large of a burst of errors can be detected