Kowalczyk (“kov-AL-chick”) developed an algorithm for this task that performs a Delaunay triangulation and uses the resulting vertices as candidates for a preliminary estimation. The number of outputs to this task in an interval can be calculated using Budan’s theorem. In the Boost library this task is implemented using the TOMS748 algorithm while MATLAB uses Brent’s algorithm for it. Muller’s algorithm (15[1])solves this task by constructing a (*) parabola to determine the next iteration step. The secant method for this task converges with order phi. (10[1])One algorithm for this task fails if it encounters a stationary point because it uses the recurrence relation ‘x sub n plus one’ (10[1])equals ‘x sub n’ minus ‘ f of x over f prime of x’. For 10 points, Newton’s method solves which task that consists of solving f of x equals zero? ■END■