Figure 1-1 represents a set of constraints and the feasible solution space (feasible region) for a given Linear Programming model: Feasible region 14 Constraint 2 Constraint 1 2.8 10 20 Figure 1-1 (a) Solve by mathematically stating all the constraints that give rise to the feasible region indicated in the graph Figure 1-1. (12 marks) Let the objective function be z= cx, + cx, where e and c, are positive constants. Discuss and solve the possible optimal solutions for x, and x2 by using the graphical solution approach. (b) (13 marks) 9, 2. Constraint 4 Corstraint 3