Math problem:

3} Put a checkmark (f ) or X in the correct box next to each statement. Statement True False Newton's method applied to functions with simple roots converges quadratically, if it converges. Newton's method converges from an},r starting value. Bisection requires any two points to start the algorithm Bisection converges slower than Newton's method. Newton's method is an example of a xedpoint method. A xed point method converges if the absolute value of the slope of the xedpoint function is less than 1