Consider the modified rod cutting problem. Given a rod of length n and a price table which for each piece of rod of length i gives corresponding price pi, we want to maximize the total revenue obtained by cutting rod into pieces and selling each part at price in the price table. Each cut of the rod incurs a cost of c. Formulate a dynamic programming based strategy for this problem. Formulate the equation giving recursive substructure of this problem. It is not required to give the algorithm (psuedocode).