Here is an LP problem, followed by a graphical solution. I am providing this so you have some sense of what I expect in your homework writeups.
Please also see the homework guidelines.
Suppose we want to design a meal consisting of two foodstuffs.
One unit of food A contains 10 grams of protein, 7 grams of fat, and costs $0.45.
One unit of food B contains 3 grams of protein, 1 gram of fat, and costs $0.77.
We want our meal to contain at least 30 grams of protein and no more than 15 grams of fat.
How can this be achieved at the minimum possible cost?
Which constraints are binding and which are not?