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

1 - 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=321 + 702 + 5.23 s.t. 11 + 02 + 3 0 After adding slack variables 24 and 25, the optimal tableau is as shown below. What would be the new optimal solution if amount of available chocolate is decreased to 80 oz.? B.V. X1 3 X2 0 X3 0 Xa 4 Xs 1 RHS 300 Z 1/2 0 1 25 3/2 -1/2 -1/2 1/2 X2 1/2 1 0 25 a) 2 b) 21 0, 2, 20, x3 = 40, z = 340 10,23 = 70, z = 420 15,23 = 35, z = 280 0,22 5,23 45,2 = 260 0,22 0,22 01 d) 21