Exercise 3 please

C++ please

Exercise 1. Solve the system of congruences: = 2 ( mod 6) r= 2 mod 77) x = 3 mod 13) Exercise 2. Consider all polynomials in one variable with coefficents in Zn. Denote this set as Z X]. A polynomial is irreducible if it cannot be factored as two polynomials of positive degree. Find all irreducible polynomials of degrees 1, 2, 3, 4 in Z2[20]. Find all irreducible polynomials of degrees 2 and 3 in Z3[c) with leading coefficient 1. Exercise 3. Write a package for a class called polynomials, which will be polynomials with coefficients in Zn. Include the operations + and *. Exercise 4. Write a program that tests if a polynomial of degree 2 or 3 is irreducible in Zn(c). Exercise 1. Solve the system of congruences: = 2 ( mod 6) r= 2 mod 77) x = 3 mod 13) Exercise 2. Consider all polynomials in one variable with coefficents in Zn. Denote this set as Z X]. A polynomial is irreducible if it cannot be factored as two polynomials of positive degree. Find all irreducible polynomials of degrees 1, 2, 3, 4 in Z2[20]. Find all irreducible polynomials of degrees 2 and 3 in Z3[c) with leading coefficient 1. Exercise 3. Write a package for a class called polynomials, which will be polynomials with coefficients in Zn. Include the operations + and *. Exercise 4. Write a program that tests if a polynomial of degree 2 or 3 is irreducible in Zn(c)