Please answer using C language only:

Realize every functions of following ADT Polynomial. ADT Polynomial Object: P(x) = a_i x^e1 + ... + a_n x^e0: set with ordered pair. Here, a_i is Coefficient and e_i is Exponent e_i is integer that is move than or equals with O. Polynomial Zero():: = return polynomial, P(x) = O. Boolean Is Zero (Poly):: = if (poly) return FALS else return TRUE. Coefficient Coef (poly, expon):: = if (expon elementof Poly) return coefficient else return O Exponent Lead Exp (poly):: = the biggest exponent in return poly Polynomial Attach (poly, coef, expon):: if (expon elementof poly) return error else return polynomial poly that is inserted. Polynomial Remove (poly, expon):: = if (expon elementof poly) return poly that the term whose exponent is expon is deleted, else return error. Plolynomial Add (poly 1, poly 2):: = return polynomial poly 1 + poly 2 Polynomial Mult (poly 1, poly 2):: = return polynomial poly 1 poly 2