content area top Part 1 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 11 hours and M for 10 hours. Profit on product A is $8 and $9 on B. Maximize profit. Question content area bottom Part 1 A. Maximize 8Aplus 9B Subject to:3Aplus 3Bless than or equals11 3Aplus 2Bless than or equals10 A, Bgreater than or equals0 B. Maximize 8Aplus 9B Subject to:3Aplus 3Bless than or equals11 2Aplus 3Bless than or equals10 A, Bgreater than or equals0 C. Maximize 8Aplus 9B Subject to:3Aplus 3Bgreater than or equals11 2Aplus 3Bgreater than or equals10 A, Bless than or equals0 D. Maximize 9Aplus 8B Subject to:3Aplus 2Bless than or equals11 3Aplus 3Bless than or equals10 A, Bgreater than or equals0