x:1 :y:9 z:4

Q.1. (30 pnts.) Suppose you have a rod of length n, and you want to cut up the rod and sell the pieces in a way that maximizes the total amount of money you get. A piece of length iis worth px dollars. Let Length i and Price pi be as follows: 2 5 5 Length: 1 Price pi 1 3 b 4 9 6 17 7 8 9 10 17 20 24 30 a a) Cut a rod with length 5 by using the dynamic programming method (Complete the following table) and write the maximum total amount of money you will gain. 0 1 2 3 5 Length 1 MU [0 Maximum Total Money: b) Show how to cut the given rod with length 5 using array s