Answer Happy

Question 14 Question 3a Question 3 (a-d) concerns algorithmic design principles and recurrences. Consider the pole cutting problem from the lectures with the following price function P: length; 1 2 3 4 5 6 7 8 9 price p(i) 1 5 7 8 8 11 12 16 19 Letr(i) be the maximum revenue achievable for a pole of length. What are the values r(2) up to r(9)? • r(2): • r(3): • r(4): • r(5): . r(6): . r(7): • r(8): • r(9): < > V V