Problem 2 Lookup the 8-bit ASCII codes for "Hello world!". a) Compute the checksum. b) Is it possible that a 1-bit error is undetected? c) Is it possible that a 2-bit error is undetected? If so, give an example. Problem 3 Consider rdt2.1. What will happen if the receiver always responds NAK as long as the received packet is not the expected packet, i.e., it responds NAK if the received packet is corrupted or has the wrong sequence number (i.e., has_seq0 in "Wait for 1 from below" or has_seq1 in "Wait for 0 from below")? Explain. Problem 4 Complete the FSM for receiver A in the multi-to-one rdt by giving the event-action list for each of the remaining edges (edges (7)-(12)). Problem 5 Complete the FSM for sender A in the one-to-multi rdt by giving the event-action list for each of the remaining edges (edges (9)-(20))