3. Dynamic Programming (25) Consider an investment sccnario as given in the table. The first row is the amonnt invested. the first column is the i nvestmcnt portfolio and each cell is the amount 400 in Inv2 gives a retur returned based on the investment. For example investing of $28. 100 200 300 400 Inl 5 11 16 23 I2 4 817 28 In3 6 10 18 25 In4 7 12 22 26 Express this problen as a recursive formulation HINT: This is sinuilar to what you did for the 0-1 knapsack problem. Explain the terms in the formulation (10) What is the most return that we can get for $400? Show all the steps as to how vou obtain this value. (15)