x = 6, y = 9, z = 5, a = 9, b = 11, c = 8

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 i is worth p. dollars. Let Length i and Price p; be as follows: Length i 1 2 3 4 5 6 7 8 9 10 Price : 1 a b 9 C 17 17 20 24 30 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. Length i 0 1 2 3 4 5 s[i] Maximum Total Money: b) Show how to cut the given rod with length 5 using array s