b. Solve the problem using stage tables and write the optimal policy(ies).

An electronics 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 should be an exact multiple of $1 million, use dynamic programming to determine an investment policy that will maximize total revenue the company would earn from the three projects. (a) Formulate the problem by defining stages, decision variables, states, state transformation, and recursive relationship. Stage n : Decision variable xn : State sn: State transformation: Recursive relationship