n this question, we consider multiplying two polynomials A(x) = x2 +2x+1 and B(x) = x3 +2x+4, but with all arithmetic done modulo 7, e.g., 5 + 3 1 and 2 5 3. We will show that the Fourier transform approach still works. 1. Find a number {0, 1, 2, 3, 4, 5, 6} such that , 2, . . . , 6 are distinct modulo 7. Verify that + 2 + + 6 0