2) Consider the polynomial in a single variable x whose operations include the following:

degree() //Returns the degree of a polynomial.

coefficient(power) //Returns the coefficient of the x^power term.

chageCoefficient(newCoefficient, 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⁵ + 7x³ x² + 9

The following examples demonstrate the operations on this polynomial.

p.degree() is 5 (the highest power of a term with a nonzero coefficient)

p.coeficient(3) is 7 (the coefficient of the x³ term)

p.coefficient(4) is 0 (the coefficient of a missing term is implicitly 0)

p.chengeCoefficient(-3, 7) produces the polynomial

p = -3x⁷ + 4x⁵ + 7x³ x² + 9

Using these 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. (p and q)

d) Consider a sparse implementation of the polynomial that stores only the terms with nonzero coefficients. Complete this sparse implementation.

e) Define a traverse operation for the sparse implementation of a polynomial that will allow you to add two sparse polynomials without having to consider terms with zero coefficients explicitly.

Test Data for a) and b): p = -3x² + 6x⁹ + 7x³ 8x⁷ + 9 - 2x⁴

Test Data for c): p = -3x² + 6x⁹ + 7x³ 8x⁷ + 9 - 2x⁴ q = 9x³ - 2x⁸ + 4x³ + 6x + 2 + 7x⁴

Test Data for d) and e): p = -6x¹⁰ + 8x²⁵ + 2x⁹ 4x³ + 9x + 5x⁴

q = 43x²⁴ - 7x¹⁰ + 4x²⁵ + 12x + 2 + 3x⁴ + + 9x⁹

Requirements: 1) Use these test data above for your program.

2) Please turn both your source code and the output.

Note: Use screen print to capture the output according to the specified test data.