Aim: To simulate error detecting code using Java.

In CRC, a sequence of redundant bits, called cyclic redundancy check bits, are appended to the end of data unit so that the resulting data unit becomes exactly divisible by a second predetermined binary number known as a pattern.

At the destination, the incoming data unit is divided by the same number. If at this step there is no remainder, the data unit is assumed to be correct and is therefore accepted.

A remainder indicates that the data unit has been damaged in transit and therefore must be rejected. Using the CRC procedure discussed in the class and presented in the textbook1 , you are required to write a JAVA program that: a. gets the input data and the divisor in the form of bits and generates the frame to be sent. b. verifies if a received frame contains errors or not (with respect to the same divisor) You should hand in the following: 1- A report (PDF file) via Moodle by Tuesday, 02 January 2024 (11:59 PM) where you should clearly document your code and results (screenshots of the results). 2- The java code file. Note: only one student from each team is required to submit the assignment through Moodle