please do it in c++ , and can you show me the Algorithm Design Idea

and the blue part is inputted by the user, i.e., teacher): 1, Sparse Polynomial (Linked linear list)[Introduction of sparse polynomial: Please input the first polynomial(input & at the end): The first video of in 2.1, 25:00-38:00. Content about basic operation The coefficient and exponent of the first term: 23 implementation distribute in the last several videos in Chapter 2.] [Problem description] The coefficient and exponent of the second term: 7 20 The coefficient and exponent of the third term: -9 100 Calculate the sum of two sparse polynomials. The maximal number of terms in The coefficient and exponent of the fourth term: & an inputted sparse polynomial is 30. [Basic requirements] Use linked linear lists to implement sparse polynomial. Please input the second polynomial(input & at the end): The coefficient and exponent of the first term: 15 [Example) Problem: Calculate the sum of s1 = 2x3 + 7x20 - 9x100 and s2 = x5 - 12x20 + 3x100 4x101 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 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 third term: -9 100 The coefficient and exponent of the fourth term: & The coefficient and exponent of the fifth term: & Please input the second polynomial (input & at the end): The sum is: The coefficient and exponent of the first term: 15 23, 15, -5 20, -6 100, -4 101