Do the whole code in C++ and please share the whole code.

Problem Statement: Determine the real root of the equation: f(x) = x - x - 1 using bisection/false position method. Employ initial guesses of Xiowe = 1 and Xper = 2 and iterate until the estimated relative error , falls below a level of . = 0.0001 Tasks: 1. Write a program using bisection/false position method to locate the approximate root of the function f(x) = x3 X-1 with initial guesses (1, 2). 2. Iterate until the estimated relative error , falls below a level of , -0.0001 3. Use Horner's method to evaluate the function. 4. Use appropriate math function for your code. 5. Print the following table that show the values of approximate root, absolute error, relative error and change of limits for each iteration [Hint: Absolute Error-new approximation of root-previous approximation of root| Relative Error-new approximation of root-previous approximation of root new approximation of root Sample Input/Output: Enter the highest degree of the equation: 3 Enter values of coefficients: Coefficient x[3] - Coefficient x[2] - Coefficient x[1]- Coefficient x[0] - Enter initial guesses: Table: Steps of Bisections/False Position Method No. of Approximate Absolute Relative Change of Iteration Root Error Error Limit Approximate Root