define an array s[0..n] such that the jh element of s gives the best cut for a steal rod of length j. Given the following s array, indicate how a steal rod of length 15 should be cut In the dynamic programming solution to Rod Cutting problem, we to maximize revenue. 0 1 2 3 4 5 6 7 8 9 10 11 12 13 MIS s = [0,1, 1, 1, 4, 4, 3, 2, 8, 3, 8, 5, 7, 7,4,5] Array's indexes start from 0.