Apply Dynamic programming to the cutting rod example in two dimensions. That is, assume the input is a rectangle of height h and width w, and a table of prices for each possible rectangle size. Rectangles can be cut horizontally and/or vertically on integral inches. Write a Dynamic programming algorithm to compute the maximum profit that you can get from cutting rectangles.