Please attach the codes $.$Compare performance of two algorithms: Newton's method, bisection method, and the fixed$-$point

iteration method.

Prepare two codes $-$ one implementing the bisection method and one implementing the New$-$

ton's method. Keep the programming in such a way as to be able to change the equation,

initial approximation, and$/$or interval easily. Your code should print the number of iteration

and the approximation. These numbers will be needed to fill out tables below.

Apply bisection method to solution of $f(x)=0$ and $g(x)=0$ where:

$f(x)=e^{3x}-3e^{2x}+3e^x-1on[-0\mathrm{.}6,1\mathrm{.}4]$

$g(x)=lnx-cosxon[0\mathrm{.}6,2\mathrm{.}6]$

Note that in the case of $f(x)=0,$ we know that $x=0$ is the only root. It is not clear if a

closed form solution exists for the only root of $g.$ Use results of your simulations to fill out

the Tables $1$ and $2$ below.

Table $1.$ Convergence of the Bisection method for root of $f(x).$

Table $2.$ Convergence of the Bisection method for root of $g(x).$