Problem 1 (10 points) a) (2 points) Assume that the message 11001001 is transmitted using the CRC generator polynomial G(x)x+1. What is the transmitted frame? b) (2 points) Assume a transmission error has occurred on the leftmost bit of the frame c) (2 points) Assume G(x) = x3+1 and 1010101 is a received frame (not related to the d) e) transmitted in part (a) above. Show how the receiver detects the error transmission of part (a) above). Is a transmission error detected? (2 points) Assume a transmission error occurs in the data bits of a frame but not in the CRC bits. Will such an error always be detected? Justify your answer. (2 points) Assume a transmission error occurs in the CRC bits but not in the data bits. Will such an error always be deteted? Justify your answer. Problem 2 (10 points) Assume a communication link between a sender and a receiver has bandwidth 10 bps, length 800 km, and propagation speed 2x108 m/s. a) (2 points) Calculate the one-way propagation delay b) (2 points) Assume the frame size is 2000 bytes. Calculate the frame transmission time. c) (2 points) Calculate the amount of time from the start of transmission of a frame over this link until receiving an acknowledgement back. Assume that this acknowledgement has small length (ie., negligible transmission time, but not negligible propagation time) and that it is sent back by the receiver immediately after completely receiving the frame d) (2 points) If a sliding window protocol is used for this communication, what is the minimum sending window size that allows the sender to continue sending and buffering frames at least until an acknowledgement for the first frame arrives back? Problem 3 (10 points) ) (5 points) write in pseudocode the l-persistent CSMA CD with Binary Exponential b) (5 points) Assume a cable has bandwidth 10 bps, length 800 m, and propagation speed Backoff algorithm used in Ethernet. 2x108 m/s. What is the minimum frame length for running CSMA CD aver this cable