(20 points) Battle Bells produces two types of cowbells. Each type can be produced on one of two machines. The length of time needed to produce each product (in hours) on each machine is shown in the first table below. Each month, each machine is available for 600 hours. Each month, customers are willing to buy up to the quantities of each type at the prices given in the second table below. The company's goal is to maximize the revenue obtained from selling units during the next two months. 3. a. Write out a linear program for this problem as Compact Formulation, i.e., define appropriate sets and indices and, consequently, define parameters and variables. b. Solve your linear program using Excel Solver. You should show the following in your solution: screenshots of your spreadsheet and your Solver dialog box, the optimal objective value, and the optimal solution. Machine1 Machine 2 2 Demands Prices (S Type Month 2 Month 1 110 150 Month 2 180 120 Month 1 56 31 (20 points) Battle Bells produces two types of cowbells. Each type can be produced on one of two machines. The length of time needed to produce each product (in hours) on each machine is shown in the first table below. Each month, each machine is available for 600 hours. Each month, customers are willing to buy up to the quantities of each type at the prices given in the second table below. The company's goal is to maximize the revenue obtained from selling units during the next two months. 3. a. Write out a linear program for this problem as Compact Formulation, i.e., define appropriate sets and indices and, consequently, define parameters and variables. b. Solve your linear program using Excel Solver. You should show the following in your solution: screenshots of your spreadsheet and your Solver dialog box, the optimal objective value, and the optimal solution. Machine1 Machine 2 2 Demands Prices (S Type Month 2 Month 1 110 150 Month 2 180 120 Month 1 56 31