Question 1 A. Sweet Stuff is a small candy manufacturing company that produces two types of chocolate, x and y. Both require milk and cacao only, as follows: i. A unit of x requires 1 unit of milk and 3 units of cacao ii. A unit of y requires 1 unit of milk and 2 units of cacao The company kitchen has a total of 5 units of milk and 12 units of cacao. On each sale, the company makes a profit of: i. $6 per unit of x sold ii. $5 per unit of y sold Sweet Stuff wishes to maximise profit. Use a linear programming method to determine how many units of x and y should be produced as well as the maximum profit to be earned at that level of production.