Consider the following nonlinear programming problem:

Maximize f(x) x1 x2, subject to x2 1 x2 2 1 and x1  0, x2  0.

(a) Verify that this is a convex programming problem.

(b) Solve this problem graphically.