Find conditions on s and t to make the following LP problem: minimize x1 + x2 such that sx1 + tx2 ≥ 1, x1 ≥ 0, x2 is unconstrained (a) infeasible (b) feasible (c) have a unique optimal solution (d) have multiple optimal solutions (e) unbounded