5. (6 points). We have learned elements of convex optimization. Consider minimizing the following functions: f(x,y) = (x - 5)2 +2y+3)2 +ry, and f(x,y) = (1 -(y-3))+10((x+4)-(y - 3)2)2 Implement the gradient descent algorithm in your favorite coding language, and use it to identify the solution (cv) ERP. Start your search from (Coun) (0.2) and for a convergence with the minimum number of iterations. Plot : 1) the value of the function versus the iterations, 2) the value of the (x,y) on the top of a contour plot. Submit your code and solution including all parameters you have selected