A publishing company has $5 million to allocate to its three divisions: i=1 - Natural Sciences i=2 - Social Sciences i= 3 - Fine Arts for expansion. Each division has submitted up to 4 proposals containing the cost of the expansion and the expected revenue Ri. The relevant information is provided below. Proposal Division 1 C1 RI 0 0 1 5 2 6 1 2 3 4 Division 2 C2 R2 0 0 2 8 3 9 4 12 Division 3 C3 R3 0 0 1 4 Note that the proposals in the first row with zero costs and revenues correspond to the option of allocating nothing to that particular division. Company's goal is to determine the best set of proposals that will generate the maximum revenue. Solve this problem using dynamic programming. Write down the stage, state, decision and recursive relationship and clearly. Show your calculations. A publishing company has $5 million to allocate to its three divisions: i=1 - Natural Sciences i=2 - Social Sciences i= 3 - Fine Arts for expansion. Each division has submitted up to 4 proposals containing the cost of the expansion and the expected revenue Ri. The relevant information is provided below. Proposal Division 1 C1 RI 0 0 1 5 2 6 1 2 3 4 Division 2 C2 R2 0 0 2 8 3 9 4 12 Division 3 C3 R3 0 0 1 4 Note that the proposals in the first row with zero costs and revenues correspond to the option of allocating nothing to that particular division. Company's goal is to determine the best set of proposals that will generate the maximum revenue. Solve this problem using dynamic programming. Write down the stage, state, decision and recursive relationship and clearly. Show your calculations