Given the following instance of the rod cutting problem, construct an optimal solution for a rod of length n=4, using Dynamic Programming Show each step. You need not draw a table. But show the filling of the entire array. At the end, show the maximum revenue and the optimal way of cutting the rod of length 4. Length i Price Pi 1 2 5 1. 2 6. 11 3. 16 4. 20 5.