Question 1 (10 marks): Newton-Raphson method Give a C# implementation of the Newton-Raphson method. Apply your code to find the root of the following functions with a tolerance of 10-10: 1. f1(x) = 3.23 3x2 x + 2. Use an initial guess of po = -1.5. 2. f2(x) = 1 + In(x 4) 5. An initial guess of po = 5.1 can be used. What happens for an initial guess of po > 5.405? Explain your findings. 3. f3(x) = 1 + ei? 5. Use an initial guess of po = 0.5. Print for each case the approximated root at every iteration step