Consider the following linear programming problem A coffee merchant sells two blends of coffee. Each pound of blend A contains 80% Mocha Java and 20% Jamaican and sells for $3 a pound. Each pound of blend B contains 30% Mocha Java and 70% Jamaican and sells for $2.25 a pound. The merchant has available 1000 pounds of Mocha Java at $1.00 per pound and 600 pounds of Jamaican at $1.50 per pound. The merchant would like her costs to no more than $600, The merchant will try to sell the amount of each blend that maximizes her income. Let x be the number of pounds of blend A and y be the number of pounds of blend B Choose the appropriate Constraints for this problem 1) 35x +.65y 1000 6) x + y s 1000 7).2x + 7y =0