2 a) b) c) In a rod cutting problem, given a table of prices P, you are required to determine the maximum revenue I obtainable by cutting up a given rod of length n and selling the pieces. The following is a price matrix in one such situation. Length/i 1 Price / Pi 1 2 5 3 8 4 8 How can brute force approach be used to solve this problem. Is this approach a realistic one? Explain. Apply greedy approach on this particular case and show whether it will give an optimal solution. Write down the top-down memoized DP algorithm to solve the rod cutting problem 6 marks 7 marks Page 2 7 marks