Please solve both 1 and 2 in python.

Consider the problem of minimizing a scalar function f(x). Most numerical algorithms will find a value x where f(x)=0 and x is a local minimizer of f(x):f(x)f(x) for all x in a neighborhood of x. One algorithm for finding such local minimizers is the steepest descent algorithm. The basic idea is to start with some guess xk and then update this guess using the equation xk+1=xkf(xk) where 0 is known as the learning rate. The algorithm terminates when f(xk)