Given a rod of length 7 units and the table below of prices pi for i = 1, 2, ..., 7, determine the max- imum revenue rn that can be obtained by cutting the rod and selling the pieces. Use the algorithm EXTENDED-BOTTOM-UP-CUT-ROD(P, n) and fill in the arrays r and s for each iteration. Write the number and length of the pieces in the final solution. length i | 1 2 3 4 5 price pi 2 2 4 6 9 6 7 13 14