Length 1 2 3 Price 1 3 3 Consider the following length-price table: 6 7 8 5 6 6 9 10 4 5 For this length-price table, diagram the OPT[-] table computed by the dynamic programming algorithm we saw in class. In particular, for each entry table j = 0, 1, ..., 8, OPT[j] should store the maximum revenue that can be obtained from cutting a rod of length j in your diagram. (Where we define OPT[0] = 0 as a vacuous base case.) To earn partial credit, be sure to show the comparisons/calculations the algorithm will make when computing each entry in the table.