Consider the problem: "Use bisection search to optimize the problem
min for second degree polynomial f in given closed interval." Does that mean we find numerically solutions to f(x)=f(y)=a using bisection search and then return (x+y)/2 or is there an another approach?