Please help me with this program (please write it in computer) and not use structures

5. Consider a sparse implementation of the ADT polynomial that stores only the terms with nonzero coefficients. e, you can represent the revised polynomial p in Exercise 9 of Chapter 1 with 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