A transmitter uses a cyclic redundancy check $($CRC$)$ code to

protect the data transmitted. The remainder calculated is found to be

equal to $x+1.$ If the generator polynomial is not known, the CRC bits

must be:

$($a$)11$

$($b$)011$

$($c$)0011$

$($d$)$ neither $a,b$ or $c$

The transmitted polynomial is found to be equal to $x^6+x^5+1.$ In this

case the transmitted information bits are:

$($a$)1100001$

$($b$)00011000000$

$($c$)000011000001$

$($d$)$ neither $a,b$ or $c$

At the receiver, the syndrome polynomial $S(x)$ is found to be equal to

$x$ or $010.$ In this case:

$($a$)$ the $2^{nd}$ bit of the received frame is in error $($b$)$ the received frame

is in error $($c$)$ both the received frame and the $2^{nd}$ bit are in error $($d$)$

the received frame is correct