2. (2 points) During an online exam, the answer you want to send to a true/false question is Yes. Instead of "Yes", the only thing you need to send is an uppercase ' Y '. The ASCII code for ' Y ' is 89 in decimal and 01011001 in binary. Data Link layer helps you check the data, ' Y ', that you transmitted to the server to make sure ' Y ' is not accidentally change to other letter due to the noise and interference during the transmission. The technique to check the content is called cyclic redundancy check (CRC). On the transmitter side, CRC encode the message to with redundancy at the tail. On the receiver side, CRC recompute the entire codeword to verify the correctness. Assume the generator polynomial g(x)=x4+x3+1. The message bit is 01011001, which is letter Y. Please encode the message to a 12-bit codeword as the transmitter. Also, show that at the receiver side, the remainder is zero if the codeword is received correctly. 3. (1 points) If the received 13-bit word for the coding scheme from Problem 2 is 1100100010111, what is the remainder? 2. (2 points) During an online exam, the answer you want to send to a true/false question is Yes. Instead of "Yes", the only thing you need to send is an uppercase ' Y '. The ASCII code for ' Y ' is 89 in decimal and 01011001 in binary. Data Link layer helps you check the data, ' Y ', that you transmitted to the server to make sure ' Y ' is not accidentally change to other letter due to the noise and interference during the transmission. The technique to check the content is called cyclic redundancy check (CRC). On the transmitter side, CRC encode the message to with redundancy at the tail. On the receiver side, CRC recompute the entire codeword to verify the correctness. Assume the generator polynomial g(x)=x4+x3+1. The message bit is 01011001, which is letter Y. Please encode the message to a 12-bit codeword as the transmitter. Also, show that at the receiver side, the remainder is zero if the codeword is received correctly. 3. (1 points) If the received 13-bit word for the coding scheme from Problem 2 is 1100100010111, what is the remainder