Code must be in Python. Thank you.

Problem 7 (The Secant Method). Newton's Method for root-finding is a powerful method. However, it requires the evaluation of the derivative of the underlying function f at the current iteration, that is, f(xk) (where xk is the approximation to the root at the current iteration k ). When f(x) is not explicitly known, we can not directly use Newton's Method. The Secant Method replaces f(xk) with a finite difference approximation. More precisely, we approximate f(xk) with f(xk)xkxk1f(xk)f(xk1) This leads to the following Secant Iteration: xk+1=xkf(xk)f(xk1)xkxk1f(xk),k1. An important fact about the Secant Method is that to update the current iteration, we need the iteration before the current one. Therefore, the method requires two initial points to be started. (a) Implement the Secant Method using the size of the update xk+1xk and the function value at current iteration f(xk) as stopping criteria. (b) Let f(x)=x3cosx. Using the code in (a) to find the root of f starting with the initial guess x0=1 and x1=0.2864. Include the code of (a) and the first 10 iterations of (b) in your submission