LINEAR PROGRAMMING PROBLEM QV Chocolate Company produces only two types of chocolate - A and B. Both the chocolates require Milk and Choco only. To manufacture each unit of A and B, the following quantities are required: Type of Chocolate B Ingredients Milk Choco Q Maximum Supply Per Batch 50 60 A 1 2 NN 2 On each sale, the company makes a profit of $3 per unit A sold $4 per unit B sold. ANSWER THE FOLLOWING QUESTIONS: Step 1: Read the problem carefully and then formulate the PROFIT EQUATION, Step 2: Given the manufacturing data (table), formulate the CONSTRAINTS or INEQUALITIES. Step 3: Graph the feasible region to solve the resulting linear programming problem. Step 4: Using the graph, LIST and EVALUATE cach potential solution. Step 5: Based on your Step 4 evaluation, answer the following questions using complete sentences: a) How many of each type of chocolate should be manufactured each day to realize a maximum profit? b) What is the maximum profit