Consider the following linear program: Max A - 2B s.t. + 3B S 3 4A A - Bs 3 A,B20 a. Select the correct graph that shows the feasible region for the problem. (1) B B (ii) 10 10 9 9 Feasible Region 8 8 Feasible Region 7- 7- Constraint #1 Constraint #1 2 5 Constraint #2 Constraint #2 4 3- 2- Objective Function=3 Objective Function = 3 A A Optimal Solution Optimal Solution 5 9 10 4 9 10 B (iii) B 10 (iv) 10 9 9 8 7- Feasible Region 7- 6 6 Constraint #1 Constraint #1 5 Constraint #2 Constraint #2 4 3- 2 Feasible Rgion 2 Objective Function = 3 Objective Function = 3 Optimal Solution Optimal Solution A 7 9 10 5 9 10 2. Is the feasible region unbounded? Yes .. Find the optimal solution. If your answer is zero, enter "O". A = B= ZE 1. Does an unbounded feasible region imply that the optimal solution to the linear program will be unbounded? The input in the box below will not be graded, but may be reviewed and considered by your instructor