EasyProduct, a piping company, manufactures three composite product types: Flange, Fitting, and Elbow. These products undergo a protective layer application, curing in an autoclave, and final packaging before being sold. Here are the processing times and packaging requirements: Flange: 4 minutes for covering and 2 minutes in the autoclave, requires 8 units of standard packaging. Fitting: 2 minutes for covering and 1.5 minutes in the autoclave, requires 6 units of standard packaging. Elbow: 1.5 minutes for covering and 0.5 minutes in the autoclave, requires 1 unit of standard packaging. Currently, there are 480 units of standard packaging, 200 covering minutes, and 80 autoclave minutes available. Product prices are as follows: Flange (6), Fitting (3), and Elbow (2). The goal is to maximize total revenue, considering that all available resources have already been purchased. The formulation of this problem should satisfy four requirements for standard Linear Programming 1. There are limited resources and there is an explicit objective function 2. The equations are linear 3. The resources are homogenous (everything is in one unit of measure) 4. The decision variables are divisible and nonnegative (we can make a fractional part of each case) (i) Formulate this problem as a Linear Programming problem. (ii) Assume that the company discontinue making the elbows. Use the data in Question (i) to graph the problem and highlight the feasible region. Show on your graph, one decision point in the feasible region that can produce Flanges and Fittings for profit