5) Consider the following linear programming model with 4 regular constraints: Maximize 3X+5Y subject to: 4X+3Y50 2X+1Y20 4X+4Y48 X2 X, Y 0 (constraint #1) (constraint #2) (constraint #3) (constraint #4) (non-negativity constraints) (a) Which of the constraints is redundant? Constraint # Justify by drawing a graph similar to Figure 7.14 on p.263. (b) Is point (9,3) feasible? Constraint #1: Constraint #2: Constraint #3: Constraint #4: (a) Draw your graph in the space below: Why (by analyzing each of the constraints)? (c) Which of the following points yields the best solution? Underline the best solution: (7,5), (9,2), (6,6). Justify your answer (using the data from the above LP model). (7,5): (9,2): (6,6)