Modify the bisection method function

So that it returns the sequence of approximate roots, errors, and number of iterations performed $($as we do in our implementations of the Newton$-$Raphson and Secant methods$).$

Use a while loop to stop the bisection method if a maximum number of iterations has been performed or the error $($as measured as half$-$interval width$)$ is less than a given tolerance.Modify the bisection method function

So that it returns the sequence of approximate roots, errors, and number of iterations performed $($as we do in our implementations of the Newton$-$Raphson and Secant methods$).$

Use a while loop to stop the bisection method if a maximum number of iterations has been performed or the error $($as measured as half$-$interval width$)$ is less than a given tolerance.

def bisect $,$ tol$)$:

$""$n$"$

Performs bisection to find root of $f$ in interval $a,b.$

$f$: target function $($function object$)$

$a,b$ : end points of interval containing a root of $f.$ Must have $fnpx=np*zeros(nmax)=1x0,x1a,bm=0\mathrm{.}5**(a+b)x=$