Maximize Z = 15X1 + 20X2 subject to12X1 + 4X2 ≥ 3612X1 – 6X2 ≤ 24X1, X2 ≥ 0The above linear programming problem has

• A. infeasible solution
• B. unbounded solution
• C. alternative optimum solutions
• D. degenerate solution