Reference no: EM131217993

Question: Consider the following inventory problem. You are running a store that sells trucks. Letd_idenote the number of trucks you expect to sell in monthi, i = 1, ... , n.Your store can only storeStrucks and it costsCto store a single truck a month. You receive trucks by placing orders, there is a fixed ordering feeKeach time each time you place an order. The shipment of an order arrives at the beginning the month. You start with no trucks at the beginning. The problem is to design an efficient algorithm that decides how to place orders so that you satisfy all the demands {d_i} and minimize the total costs.Answer this question in order of

(1) problem input/output description (writing [10]), 

(2) solution recurrence and algorithm design  (writing [15]),

(3) algorithm analysis  (writing [5]).