Implement in any higher programming language $($preferably Python or

Java$)$ the following computer networks algorithms in step by step clear

presentation as tutorials, with all temporary and final results per step. All

algorithms reports should include evaluation of results, timing

comparisons and results, complexity estimations in different test cases

starting from simple topologies$/$configurations to larger scale

topologies$/$configurations$.$ a$)$ CRC Error Detection Algorithm with all details based on recent

literature review

b$)$ Internet Checksum Algorithm

Your evaluation program of these algorithms should check their capability to detect

burst errors in long messages.

Your messages will be random messages of $128,256,512,1024,2048,8192,16384,$

$65536$ bytes. For at least $500$ messages for each of the above mentioned lengths you

should apply CRC error detection and Internet Checksum algorithms.

Regarding CRC error detection you should compare the capabilities for error

detection of the CRC generator polynomials. The following CRC polynomials could

be used. But you could extend this list creating your own ones too.