Hi can someone solve this in C++ Language code? thanks in advance <3

Root finding is one of the most important topics for several engineering specializations. It is used in automatic control design as well as in solving optimization problems for machine learning. In this project, we are going to solve the following root finding case f(x)=anxn+an1xn1+an2xn2++a1x+a0=0 The requirements will be as follows: 1. The user must input the polynomial as an input string. Then your program makes sure it is in correct format and hence finds the order n and the coefficients, a. 2. Coefficients will be stored in a dynamic array. An example of the input will be a string as follows: 5x3x2+2.5x+1 This means a third order polynomial with coefficients of 5,1,2.5, and 1 . 3. The program should never ask the user of the order of the equation or to input the coefficients except i the form of the string as shown in the example. 4. The program will detect any error encountered with the user input. The following are error examples: 5x3x2+2.5x+5x3x+2.5x+15x3x2+2.5x+1 5. The program will print all the real and complex roots of polynomials. 6. Your program must be able to work for polynomials up to the fifth order. 7. The students will demonstrate the use of pointers, strings, and different arithmetic and mathematical operations or algorithms used in their implementations. 8. Ten different testing cases must be demonstrated with validated roots to show the efficiency of the implemented program. 9. A group of 3 students maximum for each project. 10. All projects will be tested for plagiarism. Copied projects get zero marks