Problem 2 (30 points) Suppose you have $3Million to invest across 3 different investments. You do not need to invest in each of the 3 options, but all investments made must be in multiples of $1 Million. The table below shows what your revenue will be for each amount of investment in the 3 options. Use Dynamic Programming to show what the optimal investment mix would be to maximize the revenue Amount Investment Investment Investment invested 1 revenue 2 revenue3 revenue (SM) $0 $1 $2 $3 $O S7 $8 $9 $O $7 $8 $13 $0 $6 $10 $12