state thelinear programming problem in mathematical terms, indentifying the objective function and the constraints. A firm makes products A and B$.$ Products 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 $7$ hours. Profit on product A is $$8$ and $$8$ on B maximize profit