notes int expstruct poly linkfor instancethe polynomial ( ) will be stored asf( - null while maintaining the polynomial it is assumed that the exponent of each successive term is less than that of the previous term we can use these linked lists to add two polynomials to add two polynomials together we examine their terms starting at the nodes pointed to by and (two pointers used to move along the terms of two polynomialsif the exponents of two terms are equalthen the coefficients are added and new term created for the result if the exponents of the current term in is less than the exponent of current term of qthen duplicate of the term is created and attached to the pointers and (pointer to result termare advanced similar action is taken if exp( >exp( null null for the nd term exp (pexp (qhence - - - now exp (pexp (qhence now exhorted hence - the function for adding two polynomials is given belowpolyadd (struct polypstruct poly*qstruct poly * zmalloc(sizeof(struct poly))if ( =null & ==nullreturnwhile ( !=null & !=nullif ( -exp ->exp lovely professional university