(20 points) Let f:R+R be a continuous increasing function. Then we can use a version of binary search to solve for the root of the function f (value x such that f(x) = 0.) This algorithm will take the input f, starting value n such that ( e: 5. (hi +lo)/2 6. if f(v) = 0: 7. return v 8. if f(v) 0: 11. hi = v 12. return v = (a) Trace through the algorithm on the input Function Solver(2* 10,8,0.1). What value are you solving for? (b) Trace through the algorithm on the input Function Solver(x e-*,1,0.01). (c) In order for this algorithm to work, the function must be increasing. Explain what would go wrong if the function is not increasing. Is there an analogous property for lists so that Binary search would work? (d) Explain why it is important for the root r to be 0