Could you solve this question and shoe me the correct options, please ?.

2- Sugarco can manufacture three types of candy bar. These are: Type 1 candy bar, which is sold for C3 requires 1 oz. of sugar and 2 oz. of chocolate. Type 2 candy bar, which is sold for c7 requires 1 oz. of sugar and 3 oz. of chocolate. Type 3 candy bar, which is sold for C5 requires 1 oz. of sugar and 1 oz. of chocolate. Fifty oz. of sugar and 100 oz. of chocolate are available. After defining I; to be the number of Type I candy bars manufactured, Sugarco should solve the following LP: max z=3.01 + 702 + 513 s.t. Il + 2 + 23 0 After adding slack variables 24 and 25, the optimal tableau is as shown below. SugarCo is considering a forth type of candy which requires 3 oz. of sugar, 4 oz. of chocolate and can be sold for C17. What would be the new optimal solution? B.V. X RHS X1 3 X2 0 4 Xs 1 Z 0 300 X O 1 25 1/2 1/2 3/2 -1/2 -1/2 1/2 X2 1 1 0 25 a) 30 type 2 candy. 10 type 4 candy for a profit of c310 b) 25 type 2 candy, 25 type 3 candy for a total profit of C300 c) 20 type 3 candy. 10 type 4 candy for a profit of C300 d) 20 type 2 candy, 10 type 4 candy for a profit of C310 e) 30 type 3 candy. 10 type 4 candy for a profit of C310