C++

Consider a sparse implementation of the ADT polynomial that stores only the terms with nonzero coefficients. For example, you can represent the revised polynomial p in Exercise 9 of Chapter 1with the linked chain shown in Figure 4-10. a. Complete the sparse implementation. b. Define a traverse operation for the ADT polynomial that will allow you to add two sparse polynomials without having to consider terms with zero coefficients explicitly. Consider the ADT 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^term. changeCoefficient (newCoefficient, power) // Replaces the coefficient of // the x^power 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 coeffi cient) p.coefficient (3) is 7 (the coeffi cient of the x^3 term) p.coefficient(4) is 0 (the coeffi cient of a missing term is implicitly 0) p. change Coefficient(-3, 7) changes the polynomial p to -3x^7 + 4x^7 + x^3 - x^2 + 9