At a transmitter using a cyclic redundancy check $($CRC$)$ code with

a generator polynomial of degree $4,$ the remainder calculated is

found to be equal to $0.$ In this case the CRC bits are:

$($a$)0($b$)00($c$)000($d$)0000$

$($a$)($b$)($c$)($d$)$

The polynomial syndrome of the CRC code is found to be equal to

x

$2+1$ or $101.$ The receiver accepts the received data after correcting

the fifth bit.

$($a$)$ The receiver is correct $($b$)$ The receiver is not correct

$($c$)$ The message has been corrected properly $($d$)$ neither a nor b

nor c