Need help on #3 only. Will rate

3. Let g(x)- + Write a program (using Matlab/Octave or C/C++) that inplenents fixed point iteration as discussed in class (i.e., do not use any built-in fixed point iteration functions, if they are available). If you like, your code may assume that the fixed point iteration will converge quadratically. Run your program using p0 1.5 and 10-6 What was the final p(n) value (include what value of n it was)? What was the final e( n 1) approximation (including what value of n it was)? Use 9 significant figures for your answers. Hint. Since e( n- 1 ) = abs( p( n ) -p( n- 1 ) ); can only be calculated for n >= 2, you can use an if statement in your loop so that you only approximate the error just set the error approximate to, for example, 10. 4. Let f(z) 25. a) Find the corresponding fixed point function g(x) for Newton's Method. b) Starting with the initial guess Po = 2.5, run Newton's Method by hand to complete the following table. Keep as many digits of precision as you calculator (or program if you write one!) gives (hopefully at least 8) in intermediate calculations and from one iteration to the next, but round to 7 significant figures (which will mean 6 digits after the decimal) when filling in the table to turn in. nPn 0 2.5