Design a dynamic programming algorithm for the following problem. A rod has length n and a segment of length i costs p[i] dollars. The costs p[i] are known for all i = 1,...,n. The problem is to determine what is the maximum revenue a company can obtain by cutting the rod and selling the segments obtained after the cutting- For the dynamic programming solution, we define the subproblems r[i] =max revenue by cutting a rod of length i. (a) How much is r[0]? (b) Give a recurrence formula that calculates r[i] as a function of r[j], for j