Please Answer Only C

4.9-5.* Consider the following problem. Maximize Z=2x12x2+3x3, subject to x1+x2+x34(resource1)2x1x2+x32(resource2)x1+x2+3x312(resource3) and x10,x20,x30. C (c) Use a software package based on the simplex method to solve the problem and then to generate sensitivity information. Use this information to identify the shadow price for each resource, the allowable range for each objective function coefficient and the allowable range for each right-hand side