(30 points) The forecasted demand D(t), fixed ordering cost K(t), unit variable cost c(t), and inventory holding cost per unit per week h(t) of an item are as follows. Week (t) D(t) K(t) c(t) h(t) 1 30 150 5 1 2 50 120 5 1 3 70 90 5 1 4 50 60 5 1 5 30 30 5 1 Shortages are not allowed. Initial and final inventory levels are zero. Determine the optimal timing and quantities of replenishment orders for this item using the dynamic programming algorithm.

(30 points) The forecasted demand D(t), fixed ordering cost K(t), unit variable cost c(t), and inventory holding cost per unit per week h(t) of an item are as follows. Shortages are not allowed. Initial and final inventory levels are zero. Determine the optimal timing and quantities of replenishment orders for this item using the dynamic programming algorithm