For Questions show the code solution for just the Secant Method for question 2.a) and for the Secant Method please include comments explaining the code and providing detail to it that explains what is do what and what does this variable represents, etc. Please show the steps clearly for the Secant Method.

Question 2. Open Methods For this problem, you are required to build MATLAB functions for the secant method, Newton's method, and the fixed point method to approximate a root r satisfying f(r)=0 for a given function f. Each function will take as nput a real-valued function " fn, an initial guess for the root " x0" (and an additional initial guess " x1" in the case of the secant method), a desired number of significant figures " p" to which the root approximation should converge, and a maximum number of iterations "nmax". Design your algorithms to iterate until either the approximation has onverged to p significant figures or the number of iterations has exceeded nmax. (a) Consider the function f(x)=e1012x+107x1. Using tools from first year calculus, approximate the location xmin where this function achieves a global minimum value (round your answer to 4 significant figures), and justify how you know it is a global minimum. Then use the Mean Value Theorem to prove that this function has at most two roots which must lie on either side of xmin. By making initial guesses which are selected appropriately relative to xmin, use the secant method and Newton's method to approximate the roots of f to 8 significant figures