State the Linear Programming Problem in Mathematical Terms, Identifying the Objective

Multiple Choice

State the linear programming problem in mathematical terms, identifying the objective function and the constraints.
-A car repair shop blends oil from two suppliers. Supplier I can supply at most 45 gal with $3.9 \%$ detergent. Supplier II can supply at most $67 \mathrm{gal}$ with $3.3 \%$ detergent. How much can be ordered from each to get at most 100 gal of oil with maximum detergent?

A) Maximize $0.033 x+0.039 y$
Subject to: $x \leq 45$
$y \leq 67$
$x+y \leq 100$ .
B) Maximize $45 x+67 y$
Subject to: $x \geq 45$
$y \geq 67$
$0) 039 x+0.033 y \geq 100$ .
C) Maximize $45 x+67 y$
Subject to: $x \leq 45$
$\mathrm{y} \leq 67$
$0) 039 x+0.033 y \leq 100$ .
D) Maximize $0.039 x+0.033 y$
Subject to: $0 \leq x \leq 45$
$0 \leq \mathrm{y} \leq 67$
$x+y \leq 100$ .