Hi can you please solve this linear programming problem? Thanks.

A pottery manufacturer sells four types of dinner settings. The resources needed to produce one setting of each type and the sale price are given in the table below. A total of 3,300 units of raw material and 4,000 labor hours are available. To meet customers demand, a total of exactly 1000 settings must be produced. Customers also demand that at least 400 settings of Type 3 product be produced. Resources Raw material Hours of labor Sale price Type 1 Type 2 Type 3 Type 4 2 2 66 78 89 112 The formulation of the revenue maximization problem is given below. The decision variable i denotes the number of settings of Type i produced, for i = 1,..,4. We allow, for the purpose of this problem, that the number of settings can be fractional. maximize 66x + 78.12 + 8913 +11214 subject to x + 12 +13 + 14 = 1000 13 > 400 211 + 3.12 + 483 + 714