The Steepest Descent Method proceeds to find the minimum of a function f(x) where x E R" by finding the value of a which minimizes f(x* + as*) at each iteration k. The next iterate is then given by x*+1 = x* + as* where s = -Vf(x"). Determine the value of a in the case where the objective function is a quadratic %3D 1 f(x) =x"Qx+c"x+ co 2 State all assumptions.