Suppose that separable programming has been applied to a certain problem (a certain "original problem") to convert it to the following equivalent LP model maxz=5x11+4x12+2x13+4x21+x22 s.t. 3x11+3x12+3x13+2x21+2x2225 2x11+2x12+2x13x21x2210 x112 x123 x213 x221 x11,x12,x13,x21,x220 Please do the following: 1. What was the mathematical (nonlinear) model for the original problem? Answer this by plotting the profit graph for each of the original activities (xi) and then writing the optimization model (do only the last step of the modeling process) for the original problem in terms of the original decision variables. Solve both the original problem and the separable programming problem using Excel and compare (100 points). Suppose that separable programming has been applied to a certain problem (a certain "original problem") to convert it to the following equivalent LP model maxz=5x11+4x12+2x13+4x21+x22 s.t. 3x11+3x12+3x13+2x21+2x2225 2x11+2x12+2x13x21x2210 x112 x123 x213 x221 x11,x12,x13,x21,x220 Please do the following: 1. What was the mathematical (nonlinear) model for the original problem? Answer this by plotting the profit graph for each of the original activities (xi) and then writing the optimization model (do only the last step of the modeling process) for the original problem in terms of the original decision variables. Solve both the original problem and the separable programming problem using Excel and compare (100 points)