You are given the following linear programming model in algebraic form, where x1 and x2 are the decision variables and Z is the value of the overall measure of performance.

Maximize Z = 2x1 + 3x2

subject to

Constraint on resource 1: x1 + x2 <= 3 (amount available)

Constraint on resource 2: x1 + 3x2 <= 9 (amount available)

And x1; x2 >=0

1. Identify the objective function, the functional constraints, and the non-negativity constraints in this model
2. Is (x1, x2) = (2, 2) a feasible solution?
3. Is (x1, x2) = (2, 1) a feasible solution?