I am not sure how to complete this program, I have determined the variables and while loop but am stuck there. Thanks

COP2271 C++ Spring 2020 Assignment 3 Due: February 6 at 11:59 pm Newton's Method Implement Newton's Method to find roots of 3rd order polynomials given an initial guess (http://mathworld.wolfram.com/Newtons Method.html). Newton's Method is a common numerical analysis method to approximate roots of polynomials. Remember that a polynomial is a mathematical expression of variables raised to powers and multiplied by coefficients, for example: f(x) = x2 + 7x + c2 f(x) = x3 + 4x2 11x - 30 It is often necessary to find the roots of a polynomial, which are the values of the independent variable (x) that evaluate the polynomial to zero, e.g. f(x) = 0. For example, the first polynomial f(x) = x2 + 7x + 10 has two roots at -2 and -5. We can solve for these values programmatically by iteratively solving Newton's equation. The method starts with an initial guess (Xold) and uses the given polynomial and its derivative to find a new guess (Xnew): f(Xold) Xnew = xoldfderivative (Xold) This is best illustrated with an example. The polynomial f(x) = x2 + 3x + 2 has the derivative fderivative (x) = 2x + 3, and we can fine one of its roots by starting from an initial guess of o. The update formula is used every loop iteration until a root is found or too many tries have been made. A root is reached when Xnew stops changing based on the following equation: |Xnew Xolal