8. (bonus) The iteration equation for the secant method can be written in a simpler form: Pn = f (Pn - 1)*Pn-2-f(pn - 2) *Pn-1 Explain why this calculation f(n-1)-f(Pn-2) is likely to be less accurate than the one used in the algorithm presented in class. 9. (bonus) Describe an approach that would use both the bisection method and the secant method (perhaps at different stages) to overcome some of the disadvantages of each approach. 8. (bonus) The iteration equation for the secant method can be written in a simpler form: Pn = f (Pn - 1)*Pn-2-f(pn - 2) *Pn-1 Explain why this calculation f(n-1)-f(Pn-2) is likely to be less accurate than the one used in the algorithm presented in class. 9. (bonus) Describe an approach that would use both the bisection method and the secant method (perhaps at different stages) to overcome some of the disadvantages of each approach