In a rod cutting problem, given a table of prices p, the objective is to determine the maximum revenue r, obtainable by cutting up

  

In a rod cutting problem, given a table of prices p, the objective is to determine the maximum revenue r, obtainable by cutting up the given rod (of length n) and selling the pieces. The rod cutting problem exhibits optimal substructure property. The following table shows the price table for one particular situation: Length 1 i Price/ 1 Pi 2 . 5 3 8 4 9 5 10 6 17 7 17 8 20 a) Suppose you have been asked to find r. Use greedy algorithm to determiner Explain whether the greedy approach were able to find the optimal solution.