Please make sure to run the code before submitting a solution

If it does not run correctly it does not help and creates new problems

There must be one function that solves for roots using bisection and then the same function must be used to solve with false-postion method

please do not submit if you dont know the solution

Bisect vs. False position Copy the bisect function and modify it to create a false position function. Compute the roots of the function f(x)=0.074e0.3xsin(0.1x)+8 and the number of iterations required as described below. Use an error tolerance of 0.0002%. You will need to modify both functions to include the number of iterations as an output to the functions. a) Plot the function between 35 and 2. b) Compute the root between 39 and 28 for both methods. Display a table in the command window with the following columns: Method, Root, and Iterations. Display the root with 10 decimal places. Just above the table, use an fprintf statement to display a statement such as: "Using X and X as the bounds". After the table, explain the difference in the number of iterations between the two methods as text. c) Create the table again but use 26 and 6 as the bounds. Explain the difference in the number of iterations between part b and c for the False Position method as text. d) Plot all solutions (in the figure from part a) using: Bisection part b: a red asterisk False Position part b: a red square Bisection part c: green asterisk False Position part c: a green square