Problem 1 (20 points) An electronies company, Efectron, has $4 million to invest in three projects. The amount of revenue earned from a project depends on the amount of money invested in that project according to the table below. Assuming that the amount invested in a project ilould be an 2x multiple of $1 million, use dynamic programming to determine an investment policy that wit maximize total ro (a) Formulate the problem by defining stages, decision variables, staten, ano.....sformation and recursive relationship. Sage n : Decision variable x : State sa: State transformation: Recursive relationship: (b) Solve the problem using stage tables and write the optimal policy(ies)