Of the similar nature in Experiment 6.3, at least one root of a nonlinear equation f(x) = 0 in an interval (a, b) can also be found by another numerical search technique known as the bisection (or binary-search) method. The algorithm for the bisection method may be implemented following the steps described below: Given: f(a) = 0, f(b) = 0, and Erol is the tolerance of error percentage. Step 1 (initialization) a+b Set xi = a, xu = b. Compute xm = 2 Step 2 If f(xL): f(xm) 0, set x1 = xm, Xu = XU. If f(xL). f(xm)=0, then xm is the root. Stop the algorithm if this is indeed true. new - Xm x 100. Step 3 XL + XU Compute the new estimate of the root: 2 new Compute the approximation error percentage: E = Step 4 If > ETOL, set xm = xm new Go to Step 2. If &