Question $2$

$1pts$

A distributor packages and sells two types of products, A and $B.$ The respective sales prices for the products are $$5$ and $$10.$ The distributor has enough storage capacity for $5000$ total products. Packaging for product A requires $2$ hours and for product $B$ requires $5$ hours. The packaging budget allows for only $1000$ hours of labor for packaging. This linear program can be formulated as $...$

Maximize $4$A$+9$B$,$ such that, $A0,B0,A+B5000,2A+5B1000$

Maximize $4A+9B,$ such that the storage cost of $$1$ per product is minimized, while $A0,B0,A+B5000,$ and $2A+5B1000$

Maximize $5A+10B,$ such that, $A+B5000,$ and $2A+5B1000$

Maximize $5A+10B,$ such that, $A0,B0,A+B5000,$ and $2A+5B100$