1- Rod cutting Input: A length n and table of prices pi, for i = 1, 2, ..., n. Output: The maximum revenue obtainable for rods whose lengths sum to n, computed as the sum of the prices for the individual rods. . We can cut up a rod of length n in 2n-1 different ways. length i 1 2 3 4 5 6 7 8 price Pi | 1 5 8 9 10 17 17 20 1- Rod cutting (Cont.) Given the next table, prove the results of a rod of length (5 - 6) optimal solution 1 (no cuts) 2 (no cuts) 3 (no cuts) 10 2 + 2 | 13 2 + 3 117 6 (no cuts) 1 + 6 or 2 + 2 + 3 2 +6 nim tono 22