1. Which of the following is NOT a method for calculating (preciselsy) the root of a function? a. bracketing b. bisection (interval halving) d. Newton-Raphson fixed-point iteration 2. Which of the following is NOT a weakness of the Bisection Method? cannot find double roots can be fooled by vertical asymptotes does not converge quickly only works for polynomial functions a. b. c. d. 3. Identify the FALSE statement about the Newton-Raphson Method a. t is a special case of fixed-point iteration b. always converges to a root c. convergence is quadratic for single roots d. an initial guess is required 4. In the linear algebraic representation of a system of linear equations, Ax b, where A has dimensions m x n, and b has dimension of m x 1 what does m represent? a. b. c. d. number of equations number of unknowns number of equations+number of unknowns none of the above 5. A system of linear algebraic questions has an A matrix with dimensions 5 x 6. Identify the ALSE statement the system is overdetermined the system is underdetermined a. b. c. the system could have no solution d. the system can be solved as an optimization problem (e.g. using linprog)