Need a Python Code

(6 pts) Solve the foloowing problem with the steepest gradient descent method 1 Ex Ax - 6' x + min 2 where 0.78 -0.02 -0.12 -0.14 0.76 -0.02 0.86 -0.04 0.06 0.08 A= b= -0.12 -0.04 0.72 -0.08 1.12 -0.14 0.06 -0.08 0.74 0.68 and initial guess z O with tolerance of the gradient norm equal to 10-6 (2 pts) Make convergence plot in terms of the decreasing of gradient norm and make a conclusion on the convergence speed (2 pts) Find spectrum of the matrix A with a proper numpy function and compare the derived convergence plot with theoretical upper bound. How is the theoretical upper bound tight? [] # Your solution is here