Write the Constraint Inequalities and the Profit Formula for This

Write the constraint inequalities and the profit formula for this linear programming mixture problem: The Dig-the-Pig ham shop sells regular and special ham and cheese sandwiches. The regular is made of 5 oz of meat, 0.7 oz of cheese, and requires three minutes of preparation time. The special is made of 7 oz of meat, 0.6 oz of cheese, and requires 11 minutes of preparation time. The profit on a regular sandwich is 10 cents while the profit on a special sandwich is 40 cents. If Dig-the-Pig has 350 oz of meat, 42 oz of cheese, and 330 minutes of preparation time available each lunch period, how many of each type of sandwich should they try to sell to maximize profit?