Consider the following fixed-point iteration algorithm 1 = 9(z,) From a graphical solution of z = g(z) you know that z = 2.24 is approximately the fixed point of I = g(z). If you start the fixed-point...

Extracted text: Consider the following fixed-point iteration algorithm 1 = 9(z,) From a graphical solution of z = g(z) you know that z = 2.24 is approximately the fixed point of I = g(z). If you start the fixed-point algorithm with z, = 2.38, how many iterations you need to perform at least in order to reach an error less than 10? Use your knowledge about the order of convergence of the fixed-point method to conduct your analysis. !! Answer