Use python or Matlab to show all thework.

2. (10 points) Consider the steepest descent method with exact line search for minimizing quadratic function: f(x) = x Q x - b x, where Q is symmetric and positive definite. If the initial point is such that x - x* is parallel (proportional) to an eigenvector of Q, show that the method finds the * minimizer x in one step.