Consider the following linear program: Max 3A + 2B s.t. 1A + 1B < 10 (Constraint 1) 3A + 1B < 24 (Constraint 2) 1A + 2B < 16 (Constraint 3) A,B > 0 (Non-Negativity Constraint) Use the graphical solution procedure to find the optimal solution. [Provide graph and label, include the Optimal Solution and Objective Function Value.] Verify with Solver. [Include a screen capture of the Answer Report and explain.] Assume that the objective function coefficient for A changes from 3 to 5. The objective function coefficient for B remains 2. Does the optimal solution change. [Include a screen capture of both the Answer Report and Sensitivity Report. Explain.] Assume the objective function coefficient for A remains 3, but the objective function coefficient for B changes from 2 to 4. Does the optimal solution change? [Include a screen capture of both the Answer Report and Sensitivity Report. Explain.] For the original LP formulation, as specified for parts a and b, interpret the Shadow Price and Reduced Cost data on the Sensitivity Report.