In this problem we are working over the field , the integers mod 7. All arithmetic is done mod 7. First, write out the addition and multiplication tables for . Secondly, we want codewords to be sequences of elements from . Suppose that in order to detect and correct a possible error we will add two additional digits to the sequence. In this example, we have a sequence of length 3 that we wish to transmit, call it y1, y2, y3, so we find a polynomial f of degree at most 2 for which (all of this is done over .) (To find f we use the 6 functions I discussed in class, but again the arithmetic is done mod 7.) To detect and correct a possible error we compute and then transmit the sequence y1, y2, y3, y4, y5. If the received sequence is 1,4, 0, 6, 0 and there is at most one error, determine what the correct sequence is. (Again, remember that you are working mod 7- that will simplify the arithmetic slightly.)