Using MATLAB or python

(20 pts) Program the steepest descent method using backtracking line search and use it to minimize the Rosenbrock function f(x)=100(x2x12)2+(1x1)2. Use an initial step length of 0=1 with initial guess x0=[1.2,1.2]T. Then apply the method with the more difficult initial guess of x0=[1.2,1]T. Print the step length at each iteration