Consider the following linear programing problem: Maximize 2X 1 +2X 2 Subject to: 4x1+3x 2 >= 12 -2x 1 -3x 2 = 2 x 1,

Consider the following linear programing problem:

Maximize 2X₁+2X₂

Subject to:

4x1+3x₂ >= 12

-2x₁-3x₂ <= 6

x₂ >= 2

x_1, X₂ >= 0

The above linear programing problem:

A) Exhibits Unboundedness

B) has more than one optimal solution

C) exhibits infeasibility

D) has only one optimal solution