Assume that a company buys long steel rods and cuts them into shorter rods for sale to its customers. If each cut is free, and rods of different lengths can be sold for different amounts, determine how to best cut the original rods to maximize the revenue. The prices of rods with different lengths are listed in the following table: Length i 1 2 3 5 6 7 8 9 10 Price pi 2 5 6 11 13 18 19 22 25 4 8 Use the dynamic programming method to complete the table below. For each rod length from 1 through 10, determine the best way to cut the original rod for the highest revenue and report the number of rod segments. Length i Maximum revenue r Number of rod segments s 0 1 0 0 2 3 4 5 6 7 8 9 10