This assignment is for the "Data Structure" course. I need help in solving this question.

Thanks in advance.

UPDATE2:

In this question,

We would like to write a C function that adds two polynomials, A and B, to obtain D=A+B.

We represent A and B in a single 1D array, so , we need startA and finishA to denote the starting

and finishing point, so as to B...

For D, *startD and *finishD also denote the starting point and finishing point of D.

in this question, we uses only one global arrary---terms, to store all our polynomials

The C declarations needed are:

typedef struct{

float coef;

int expon;

} polynomial;

polynomial terms[MAX_TERMS];

int avail;

we assume that, polynomial A and B is already stored in terms[], and denoted by startA, finishA, startBfinishB. Variable avail denotes the next available position in the array terms[].

In the question, based on the above information, we asked you to write a polynomial adding function

5. rite down polynomial addition function "Add (int startA, int finishA, in startB, int finishB,int startD, int finishD) and then, Assume A(x) 2n x x2+x0 an B(x) 2n+1 2n- 1. x3+x determine the exact number of times each statement of "Add" is executed