The three questions are related, it is the SAME problem

(Use this information to answer questions 11 to question 13:) VanMetals has $3500 available for the production of new products. Wall Inc. will buy all the products they can produce. After an initial screening, VanMetals reduced the production alterna- tives to tables and chairs. Each table can be produced with a cost of $400. Each chair can be produced for $350. VanMetals can devote up to 100 hours to these new products; each table is expected to require 16 hours, and each chair is expected to require 8 hours. The selling prices are $600 per table and $400 per chair. VanMetals's owner would like to use all-integer linear programming without relaxation to determine the number of tables and the number of chairs to produce to maximize revenue. 11. (7 points) What is the most relevant linear programming problem? (a) (c) max (600 x + 400 y) 400 . x + 350 y 0 x 0 (b) (d) max (400 x + 600 y) 400.3 +350 y 0 x 0 12. (10 points) Right feasible region is (a) (0.625,9) (0.9) (c) (0.875, 5) (0.9) (2-917, 6.667) (3.25, 6) 94, 4.5.). (44.4.5.). (4,0) (4,0) (b) (d) - (1.125,9) (10.875, 5) (0.9) (0.9) (2.583, 7.333) (14, 4.5.). 0) (4,0) 13. (5 points) What is the number of tables and the number of chairs to be produced to maximize revenue? (a) (4,2) (b) (6,3) (c) (2,4) (d) (3,6)