PROBLEM A Kelson Sporting Equipmentr Inc. makes two different types of baseball gloves: a regular model and a catcher's model. The firm has 000 hours of production time available in the cutting and sewing department. 300 hours available in the finishing department, and 100 hours available in its packaging and shipping department. The production time requirements and the profit contribution per glove are given in the following table: Model Production Time {Hou rs] ProfitiGlove Cutting 8: Finishing Packaging Sewing 8: Shipping Regular Model 1 U2 U8 P5 Catcher's Model 3f2 U3 U4 P8 Assuming that the company is interested in maximizing the total profit contribution, answer the following requirements: 1. Develop the objective and constraints functions 2. Plot in agraph the constraint functions and identify.r the feasible region. 3. Find the optimal solution. How many gloves of each model should Kelson produce? 4. 1Il'v'hat is the total profit contribution that Kelson can earn with the given production quantities? PROBLEM B As part of a quality improvement initiative, Consolidated Electronics employees complete a three-day training program on teaming and a twoday training program on problem-solving. The manager of quality improvement has requested that at least 8 training programs on teaming and at least 10 training programs on problemsolving should be offered during the next six months. In addition. seniorlevel management has specied that at least 25 training programs must be offered during this period. Consolidated Electronics uses a consultant to teach the training programs. During the next quarterr the consultant has 34 davs of training time available. Each training program on teaming costs P10,000 and each training program on problemsolving costs P3000. 1. Formulate a linear programming model that can be used to determine the number of training programs on teaming and the number of training programs on problemsolving that should be offered in order to minimize total cost. Graph the feasible region. Determine the coordinates of each extreme point, Solve for the minimum cost solution. PW!\