Calculate the sum of two sparse polynomials. The maximal number of terms in an inputted sparse polynomial is 30. [Basic requirements] Use linked linear lists to implement sparse polynomial. [Example]...

 Calculate the sum of two sparse polynomials. The maximal number of terms in  an inputted sparse polynomial is 30. [Basic requirements] Use linked linear lists to implement sparse polynomial. [Example] Problem: Calculate the sum of s1 = 2x³
+ 7x²⁰
-9x¹⁰⁰
and s2 = X⁵
- 12x²⁰
+3x¹⁰⁰
-4x¹⁰¹
What you need to show in the terminal(the back part is outputted by you  and the blue part is inputted by the user, i.e., teacher): Please input the first polynomial(input & at the end): The coefficient and exponent of the first term: 2 3 The coefficient and exponent of the second term: 7 20 The coefficient and exponent of the third term: -9 100 The coefficient and exponent of the fourth term: & Please input the second polynomial(input & at the end): The coefficient and exponent of the first term: 1 5 The coefficient and exponent of the second term: -12 20 The coefficient and exponent of the third term: 3 100 The coefficient and exponent of the fourth term: -4 101 The coefficient and exponent of the fifth term: & The sum is:  2 3, 1 5, -5 20, -6 100, -4 101

The requirements of reports:

1.The algorithm design idea

2.The source code with necessary comments

3.Test case and results (show the screenshot of your terminal)；

4.Summary