#1 Consider the following linear programming model with two decision variables, A and B. Use the graphical solution method to determine the optimal solution to this linear programming model. Be sure to draw and label all constraints, identify the feasible region, draw a representative objective function, identify the optimal solution, and indicate the optimal objective function value. #2 LaneTec is a sporting equipment manufacturer that produces two different types of bowling balls, the PinSeeker and the StrikeRite. The profit margins are $20 for each PinSeeker ball and $15 for each StrikeRite ball. The bowling balls are made using three separate processes: forming the core, adding the middle layers, and finishing with a urethane resin mixture. There is one machine for forming the core and one machine for adding the middle layers; three machines are available for the finishing process. Each machine can be operated for 10 hours per day. Both types of bowling balls require 3 minutes to form their cores. Adding the middle layers takes 4 minutes per PinSeeker ball, but only 2 minutes per StrikeRite ball. The finishing process takes 6 minutes per PinSeeker ball and 10 minutes per StrikeRite ball. Formulate a linear programming model to determine the optimal number of each type of bowling ball that LaneTec should produce, with the goal of maximizing daily profit. Solve the LP using the graphical solution method. Include all components as requested in Question #1. Provide all constraints in standard form.