Consider the Secant Method applied to minimising f(x) = x² + x³ in |x| < 1. We know the minimiser is x* = 0, but let's derive that the order of the method is here p = 1.6180. Question 1 Substituting the function into the Secant Method gives which of the following iterations? O #k+1 #k+1= k+1 = Oak+l (3+2+2x-1) 3(x+1)+2(x+2-1+₁) 1+22 3+42 6(1+) 21 1+2+2-1