15. You are performing a Golden Section search in order to maximize a function f. If on the first iteration, xi-4.0000, and xu-6.0000, how many iterations would be required to reduce Emax to less than 0.01? a. 14 b. 15 C. 16 d. Less than 14 e. More than 16 16. You are performing a Newton-Raphson root search on f(x)- 1/3x-x2 -3x +5 starting with xo 3 and wish to find the root near x-1. Is this a good choice, if it is a poor choice, why is it wrong and how would you fix it? a. No; will result in a divide by zero; make it slightly smaller b. No; will result in a divide by zero; make it slightly bigger c. No; you require two first guesses; add a second guess at x1-5 d. Yes; it should converge to the correct solution e. No; this function has no roots