Consider the following LP model and answer the question.

Max 3x1 + 2x2

s.t.

3x1 + 3x2 >= 6

x1 + 5x2 >= 5

end

x1, x2 0

This LP model has either unbounded or infeasible solution. Please change (fix) this problem with simple change(s) to get an optimal solution? Dont make a totally new and different problem. Just change one spot or two, and make the problem feasible and bounded. If your model is totally different (more than two spots differences) from above, you wont get any credit. Dont need to solve the fixed problem. I just need a model that gives an optimal solution.