Construct one example for each of the following types of two-variable linear programs. Provide an algebraic formulation, graph, decision variable quantities, and optimal objective value (if any). Infeasible. Feasible with a unique optimal solution. That is, one set of (x, y) that gives one optimal objective value. Feasible with more than one optimal solution. That is, more than one set of $(x, y)$ that gives the same optimal objective value. Feasible with a bounded feasible region. Feasible with an unbounded feasible region.