State the linear programming problem in mathematical terms, identifying the objective function and the constraints. A firm makes products A and B. Product A takes 3 hours each on machine L and machine M; product B takes 3 hours on L and 2 hours on M. Machine L can be used for 10 hours and M for 7 hours. Profit on product A is $9 and $9 on B. Maximize profit. Maximize 9A + 9B Subject to: 3A + 3B 10 2A + 3B 27 A,Bs0. Maximize 9A + 9B Subject to: 3A + 3B s 10 3A + 2B 57 A,B20 Maximize 9A + 9B Subject to: 3A + 3B s 10 2A + 3B 5 7 A.B20