For linear, nonlinear, and integer programs, which of the following statements are true?

Group of answer choices

a. Exactly two of the answers are correct.

b. Gradient Search can be used to solve linear programs.

c. Gradient Search solves integer programs by computing derivatives.

d. Branch and Bound solves nonlinear programs by computing derivatives.

e. The Simplex Method is a heuristic that finds the optimal solution to linear programs in many, but not all, cases.