At a receiver using cyclic redundancy check $($CRC$)$ code forerror

detection, the syndrome calculated is found to be equal to $0.$ Is the

received data:

$($a$)$ in error $($b$)$ correct $($c$)$ we cannot know $($d$)$ neither a nor b nor c

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

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

x$+1$ or $11.$ The receiver accepts the received data after correcting the

third 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