Consider the message M = XXXXXXXXXXCalculate the cyclic redundancy check (CRC) for this message using the divisor polynomial x5 + x4 + x2 + 1. Also calculate error code if the 6th bit is flipped in...

Consider the message M = 1111001101. Calculate the cyclic redundancy check (CRC) for this message using the divisor polynomial x5 + x4 + x2 + 1. Also calculate error code if the 6th bit is flipped in received data. Note: consider Most Significant bit (MSB) as first bit.