please help asap

Subject: Operations Research 2

Topic: Dynamic Programming

The company is planning to deliver 4 dozen of shirts to its customer every month. Below are the nroduction data for the next three months. The cost of storage is PhP75 per dozen for each month it is stored. There is already an inventory of 2 dozen of shirts on hand, and the company wants to retain 1 dozen of shirts after four months. a) Define Stage, State, and Alternative based on the problem. (10 points) b) Solve the problem using Dynamic Programming using backward approach, starting with month 4 . Indicate the recursive equation. Be sure to define the variables used in the recursive equation. ( 70 points) c) Find the optimal policy. (10 points) d) What is the second-best solution? Show the optimal policy. (10 points)