Use the indicated entry as the pivot and perform the pivoting. x1 1'2 *3 S152 53 z 1 1 1 1 0 0 060 3 1 4 0 1 0 0240 1 2 5 0 0 10200 -1-1-40 0 01 0 DEED 3' USED .5' USED 5' DEED 1" USED .5," USED 3' BEIGE N DEED Solve the linear programming problem using the simplex method. Maximize z = 2x1 + 3x2 subject to 5x1 + x2 5 30 3x1 + 2x2 5 50 x1 + x2 5 40 x1 , x2 2 0. (E Select the correct choice below and, if necessary, fill in the answer box to complete your choice. {-3} A- The maximum is z = when x1 = ,x2 = ,s1 = ,s2 , and s3 = {:2} B. There is no maximum solution for this linear programming problem. A cat breeder has the following amounts of cat food: 120 units of tuna, 110 units of liver. and 80 units of chicken. To raise a Siamese cat, the breeder must use 2 units of tuna, 1 of liver, and 1 of chicken, while raising a Persian cat requires 2, 1 and 3 units respectively per day. If a Siamese cat sells for $12, and a Persian cat sells for $13, how many of each should be raised in order to obtain maximum gross income? Set up the initial simplex tableau. (3) Set up the initial simplex tableau for the problem. Let x1 be the number of Siamese cats, and let x2 be the number of Persian cats. Begin by filling in missing terms for constraints. 2x1 + 2x2 s D is the constraint on tuna consumption. x1 + x2 S D is the constraint on liver consumption. x1 + 3x2 5 D is the constraint on chicken consumption