In C language Please include C and H file

Develop a program that imple The POLYNOMIAL ADT is used to represent polynomials and the following operations defined on polynomials: ments the POLYNOMIAL ADT using the LIST ADT . Evaluate p(x) z). Evaluates the polynomial p(x) at the pointx and returns 2. Add( Pr), P.(r)). Returns the polynomial that results when p,(x) is added 3. Subtract ,x), p(x)). Returns the polynomial that results when p,(x) is 4. Multiply p,(x),p (x)). Returns the polynomial that results when p, (x) is 5. Differentiate(p(x)). Returns the polynomial that results when p(x) is the result. to P2(x) subtracted from p2(r) multiplied by p.(x) differentiated. POLYNOMIAL ADT implementation to find a rea root of a given polynomial using the Newton-Raphson method. For a given function f(x), the Newton- Use your Raphson iteration function is defined as follows If /(x), .f(x), and f(x) are continuous near the root r, and f(r)#0, then if the initial approximation o is chosen close enough to r, the sequence (x,^ defined in (1) program on the polynomial p(x) = xs_ 6x4 + 8x3+8x2 + 4x-4 will converge to r Test your Newton-Raphson Start with the initial approximation xo 3