C++ , if possible show screenshot of output

Consider the ADT polynomial in a single variable x-whose operations include the following: degree) 11 Returns the degree of a polynomial coefficient (power) 11 Returns the coefficient of the xor term changeCoefficient (newCoefficient, power) II Replaces the coefficient of I the xpor term with newCoefficient For this problem, consider only polynomials whose exponents are nonnegative integers. For example, 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) 1s 7 (the coefficient of the x3 term) p. coefficient (4) 1s 0 (the coefficient of a missing term is implicitly 0) p.changeCoefficient(-3, 7) changes the polynomial p to-3x 4 +7x-x2 +9 Using these ADT operations, write statements to perform the following tasks: a. Display the coefficient of the term that has the highest power b. Increase the coefficient of the x term by 8 c. Compute the sum of two polynomials