Consider the following multiple-objective linear program: maximize 21 = zxi + x2maximize a = 3x1 4- 7a2subject to: 4x1 - 122 5 -6-4x1 4- 6r 5 124x1 4- zjq 2 8x1 + )q 5 94)q 5 16x1, )q 2 o.(3) plot the feasible region in decision space for this problem.0: ) plot the corresponding feasible region in objective space for this problem. for each extreme point indicate if it is anoninferior or a dominated solution.(c) use the constraint method (graphically) to generate an approximation of the noninferior set having 6 noninferiorsolutions evenly spaced along the 21 axis.(d) use the constraint method (graphically) to generate an approximation of the noninferior set having 6 noninferiorsolutions evenly spaced along the 22 axis.