Suppose we are given an oracle which, given a system of liear inequality constraints, either returns a vector that satisfies all inequalities in the system, or states that no such vector exists. consider a linear programming problem that admits an optimal solution. construct a simple algorithm that invokes the oracle once, and that finds an optimal solution of the linear programming problem.

The equation represents the function f, and the graph represents the function g. f(x)=3(5/2)^x determine the relationship between the growth factors of f and g. a. the growth factor of g is twice the growth factor of f. b. the growth factor of f is twice the growth factor of g. c. the growth factor of f is 2.5 times the growth factor of g. d. the growth factor of f is the same as the growth factor of g.