Write a project report regarding to the given task by answering the following questions $($please

EXPLAIN all of them by at least two sentences$)$:

$[3$p$]$ How many steps does it take to find the minimum of this function with all of these

algorithms?

$[3$p$]$ What are the execution times of these algorithms? Does this make sense?

$[3$p$]$ Does the convergence depend on the initial conditions? Why?

$[3$p$]$ Based on the last two questions, what can be the reason for this trade$-$off?

$[3$p$]$ Do you expect the same number of steps and execution times, when you change the

stopping criterion and the absolute error bound?