2.4 Random search with diminishing steplength In this exercise you will use random search and a diminishing steplength to minimize the Rosenbrock function 2.8 Exercises 8 (w, ) = 100 (w - ) + (w 1). - 43 (2.35) This function has a global minimum at the point w* = [1 1] located in a very narrow and curved valley. Make two runs of random search using P = 1000, the initial point w = [-2 -2]", and K = 50 steps. With the first run use a fixed steplength a = 1, and - with the second run - a diminishing steplength as detailed in Section 2.5.4. Compare the two runs by either plotting the contour plot of the cost function (with each run plotted on top), or by constructing a cost function history plot.