Algorithms: Dynamic Programming

Rod Cutting Problem:

Given a rod of length $($ n $=8)$ and prices $($ p $=[1,5,8,9,10,17,17,20])$ for

lengths $([1,2,3,4,5,6,7,8])$ respectively, determine the maximum revenue

obtainable by cutting up the rod and selling the pieces.