Create a nine$-$digit string which consists of writing $110$ followed by $137475,$ where

each digit is taken $($mod $2)-$ so even numbers will be $0$ and odd numbers will be $1.$

For example, with enrolment number $001234567$ you would start with $110234567$

and get the string $110010101.$

Perform a cyclic redundancy check on this string with checkword $1011,$ and then

show how the verification is performed.