Strictly Convex Function Minimum

Part 1: 1D Strictly Convex Function Minimum You are given a strictly convex function g(x) defined on the integer points within the inclusive interval [lb, ub]. Because the function is strictly convex, it has a single minimum over the domain. Your task is to find the integer x that minimizes g(x). You may call an evaluation helper for g as often as needed, but you should aim to keep the number of calls as low as possible. Part 2: 2D Strictly Convex Function Minimum Now…