Please add good explanation. Also, tell which programming language you use if you use. Thank you. If done very good I can tip.

1. Solve the following using steepest descent algorithm. Start with Xo = [1 1 1] and use stopping threshold E= 10-6. (a) Verify that the final solution satisfies the second order necessary conditions for a minimum. (b) Plot the value of the objective function with respect to the number of iterations and (c) Comment on the convergence speed of the algorithm. minimize f(x) = (a1 + 5)+ (x2+8)2 + (x3 +7)2