Consider the following linear program. Min 4A + 5B s.t. 1A + 3B 9 1A + 1B 5 A, B 0 Identify the feasible region. The A B-coordinate plane is given. There are 2 lines and a shaded region on the graph. The first line enters the window at B = 3 on the positive B-axis, goes down and right, passes through the point (3, 2) crossing the second line, and exits the window at A = 9 on the positive A-axis. The second line enters the window at B = 5 on the positive B-axis, goes down and right, passes through the point (3, 2) crossing the first line, and exits the window at A = 5 on the positive A-axis. The region is above the first line and below the second line. The A B-coordinate plane is given. There are 2 lines and a shaded region on the graph. The first line enters the window at B = 3 on the positive B-axis, goes down and right, passes through the point (3, 2) crossing the second line, and exits the window at A = 9 on the positive A-axis. The second line enters the window