(b) What linear convergence constants do you observe for each of the above starting points? (c) (Armijo Rule) Replace the bisection line search with the Armijo inexact line search (you have the freedom to pick the parameters o and s. It would be inter- esting for example to see how the behavior of the algorithm changes with different choices of ). How are the convergence and the running time affected compared to the previous exercise? Some aspects to explore are the number of iterations (Steepest Descent steps) taken by the algorithm to achieve the same level of pre- cision, the overall time the algorithm takes (in seconds), the amount of time the algorithm spends on each iteration (i.e., the time it takes to perform the line search)