K 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 2 hours each on machine L and machine M, product B takes 2 hours on L and 3 hours on M. Machine L can be used for 13 hours and M for 6 product A is $7 and $8 on B. Maximize profit. O A. Maximize 7A+8B Subject to 2A 2B13 3A + 2B6 A, B0 OC. Maximize 7A + 8B Subject to: 2A + 2B 13 3A + 2B6 A, B0 B. Maximize 7A + 8B Subject to 2A+2B 13 2A+ 3B6 A, B0 D. Maximize 8A + 7B Subject to: 2A+ 3B 13 2A+ 2B6 A, B 0