4 Error-Correcting Polynomials (a) Alice has a length 8 message to Bob. There are 2 communication channels available. When n packets are fed through channel A, the channel will only deliver 5 packets (picked at random). Similarity, channel B will only deliver 5 packets (picked at random), but it will also corrupt (change the value) of one of the delivered packets. All channels can only work if at least 10 packets are sent through it. Using the 2 channels, how can Alice send the message to Bob? (b) Alice wishes to send a message to Bob as the coefficients of a degree 2 polynomial P. For a message [mi, m2,m3], she creates polynomial P- mix^ m2x +m3 and sends 5 packets: (0,P(0)), (1,P(1)), (2,P(2)), (3, P(3)), (4, P(4). However, Eve interferes and changes one of the values of a packet before it reaches Bob. If Bob receives and knows Alice's encoding scheme and that Eve changed one of the packets, can he still figure out what the original message was? If so find it as well as the x-value of the packet that Eve changed, if not, explain why he can not. (Work in mod 1 l.) (c) Alice decides that putting the message as the coefficients of a polynomial is too inefficient for long messages because the degree of the polvnomial grows quite large. Instead, she