For the linear programming problem:Maximum Z = 3X1 + 2X2Subject to-2X1 + 3X2 ≤ 9X1 – 5X2 ≥ -20X1, X2 ≥ 0The above problem has

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