Abstract data type

Consider an abstract data type (ADT) for polynomials (in a single variable x) whose operations include the following: ini degree()//Returns the degree of the polynomial. int coefficient(int power)//Returns the coefficient of the x^power term. void changeCoefficient(int newCoefficient, int power)//Replaces the coefficient of the x^power term with newCoefficient For this problem, consider only polynomials whose exponents are nonnegative integers. For example, p = 4x^5 + 7x^3 - x^2 + 9 The following examples demonstrate the ADT operations on this polynomial. p.degree() is 5 (the highest power of a term with a nonzero coefficient) p.coefficient(3) is 7 (note that the coefficient of a missing term is implicitly 0) p.changeCoefficient(-3, 7) produces the polynomial p = -3x^7 + 4x^5 + 7x^3 - x^2 + 9 Using these ADT operations, write C++ statements to perform the following tasks for an arbitrary polynomial q. Display the coefficient of the term that has the highest power to the screen. Decrease the coefficient of the x^3 term by 2. Compute the sum of two polynomials q and r. Place the result in a third polynomial s that has been previously initialized to zero