consider a modification of the rod-cutting problem in which, in addition to a price pi for each rod, each cut incurs a fixed cost of c. the revenue associated with a solution is now the sum of prices of the pieces minus the cost of making the cut. (a) give a dynamic-programming algorithm to solve this modified problem, including the mathematical expression for the maximum revenue and the pseudocode. (b) show the maximum revenue rj and the optimal size sj of the first piece to cut off, when c