Problem-- Using sequential and dynamic list to implement the Addition, Substraction or Multiplication of two unary polynomials.

For A_m(x) and B_n(x).

A_m(x)=A₀+A₁x¹+A₂x²+A₃x³++A_mx^m

B_n(x)=B₀+B₁x¹+B₂x²+B₃x³++B_nxⁿ

Please use program to solve M(x)=A_m(x)+B_n(x),M(x)=A_m(x)-B_n(x)and M(x)=A_m(x)B_n(x).

Note-- I only need Performance Analysis of this problem. Means describe every outuput in details.(nothing else)