Question 5 12.5 pts Select the best answer. This question explores the time to send and acknowledge a frame when using retransmission on a noisy (error-prone) channel. We assume that: 1) it takes Time to send a frame (C-T(n) as defined on the slides) 2) there is a penalty P when a (re) transmission fails. 3) the packet error rate is per. The probability to send a frame and get a positive acknowledgement only after the transmission is None of these answers, (4.C + 3.P). per. (1 - per) per). (1 - per) per* (1 - per) p.(1 - p) Question 6 12.5 pts Check all that apply. Check all techniques we studied earlier that can in general be used for detecting up to two corrupted bits. 3 adding a parity bit NE Hamming codes with distance 2 EEEEE Hamming codes with distance 3 crossed parities None of these answers. Question 7 12.5 pts Select the best answer. Consider a communication over satellite under some drastic adverse magnetic interferences. Under these conditions, it may be better to use _ to correct damaged frames. odd parity even parity None of these answers. retransmission some forward error correction technique D Question 8 12.5 pts Check all that apply. Check all techniques we studied earlier that can in general be used for detecting up to one corrupted bit. Cyclic Redundancy Check checksum Hamming codes with distance 2 adding a parity bit None of these answers. crossed parities