the question 2 ,3

U puly noiai. Th code to reduce the size at used in Program 2.9 to increase array size. This of an array is very similar to th n in size doesn't change the asymptotic complexity of Add. The exercises examine an alternative array representation of polynomials and, in Chapter 4, we develop a linked representation for them. EXERCISES Use the six operations defined in this section for an ordered list to arrive at an ADT specification for such a list 1. 2. Ifa - (ao., an-1) and b (bo,,bm-1) are ordered lists, then a b. Assume that the a,s and bjs are integer. . Modify function Add so that it reduces the size of c.termArray to c.terms prior to termination. With this modification, can we dispense with the data member capacity? Write C++ functions to input and output polynomials represented as in this section. Your functions should overload the >operators. .Write a C++ function that multiplies two polynomials represented as in this section. What is the computing time of your function? U puly noiai. Th code to reduce the size at used in Program 2.9 to increase array size. This of an array is very similar to th n in size doesn't change the asymptotic complexity of Add. The exercises examine an alternative array representation of polynomials and, in Chapter 4, we develop a linked representation for them. EXERCISES Use the six operations defined in this section for an ordered list to arrive at an ADT specification for such a list 1. 2. Ifa - (ao., an-1) and b (bo,,bm-1) are ordered lists, then a b. Assume that the a,s and bjs are integer. . Modify function Add so that it reduces the size of c.termArray to c.terms prior to termination. With this modification, can we dispense with the data member capacity? Write C++ functions to input and output polynomials represented as in this section. Your functions should overload the >operators. .Write a C++ function that multiplies two polynomials represented as in this section. What is the computing time of your function