3. Assume a bit stream of 1111010 as data, polynomial X2+X as a divisor. Using the Cyclic Redundancy Check (CRC) algorithm: a) Show in detail the calculations that need to be done by the sender to generate sending bit stream. (10 Marks) b) Show in detail the calculations that need to be done by a receiver to check if the bit stream is received correctly. (10 Marks) [Total: 20 Marks]