2 In a rod cutting problem, given a table of prices P., the objective is to determine the maximum revenue 1, 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: N 3 4 5 6 7 8 Length/1 i Price/ 1 PA 5 8 9 10 17 17 20 5 marks 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. You do not need to write any algorithm. 5 marks b) Explain whether you can solve the problem using brute force approach. State any practical problem you may have (if any) when solving the problem using brute force. 5 marks c) Write down the recurrence relation for solving the rod cutting problem and hence or otherwise explain how can you solve it using dynamic programming. You do not need to write any algorithm