A food wholesaler has three kinds of individual bags of potato chips: regular, barbeque, and salt and vinegar. She wants to sell the bags of chips in bulk packages. The bronze package consists of 20 bags of regular and 10 bags of barbeque. The silver package contains 20 bags of regular, 10 bags of barbeque, and 10 bags of salt and vinegar. The gold package consists of 30 bags of regular. 10 bags of barbeque, and 10 bags of salt and vinegar. The profit is $30 on each bronze package, $60 on each silver package, and $80 on each gold package. The food wholesaler has a total of 7000 bags of regular chips, 5000 bags of barbeque, and 1000 bags of salt and vinegar. Assume all the packages will be sold. Use the simplex method to complete parts (a) and (b). (a) How many gold, silver, and bronze packages should be made up in order to maximize profit? What is the maximum profit? Set up the linear programming problem. Let X1, X2, and xg represent the numbers of bronze, silver, and gold packages made up, respectively, and let z be the total profit. ZE + subject to 20x2 + 20x2 + 30x3 10x + 10x2 +10x3 10x2 + 10X3 X720, X, 20,X3 20. (Do not factor. Do not include the $ symbol in your answers.)