Consider the following multi-objective li ear programeming problem. Minimize Z1=2x+y Muximize Z2=3x+7y 2x6y3 2x6y3 2x+3y6 2x+y4 x+y9 y4 x,y0 a. Represent graphically the feasible region (which is commoe to boch objectives). Label all 5 extreme b. Complete the table below by enieri g the values of the objective functions, and whether or not an Ctreme point is dominated (if s. indicate by what other poine) or not. c. Represent the fousible repion in (Z1,Zi) spasc. Clearlv indicate which peints are nen-dominated. d. Explain clearly how you would use the "Constraint Method" in order to generate the set of non-inferio solutions of this multi-objective programming problem, and in particular what linear programs would need to be solved (this entails constructing the payoff table; finding the range of variations of Z1 and Z2; and explaining what linear programs need to be solved)