#### Exercise 2.

In the ring of univariate polynomials with coefficients in , we consider the polynomials , , and . Using one of the FFT-based multiplication algorithms described in the course notes:
1. compute the product of the polynomials and
2. compute the product of the polynomials and
For each product, you should give (at least) the results of each Discrete Fourier Transforms. Of course, you should better choose primitive roots of unity that minize the number of required operations in .