Understand how these problems can be solved using Dynamic Programming. Now, solve each problem using an example.

h) For Rod Cutting Problem, length [] = {1, 2, 3, 4, 5, 6, 7, 8}, price [] = {1, 5, 8, 9, 10, 16, 18, 20}, Rod Length: 8. i) For Coin-change-making-problem, S = {1,5,6,8}, Desired Change is 13 j) For Word Break Problem, S = {i, like, ice, cream, icecream, mobile, apple}, Input: ilikeapple.

c) For Longest-Increasing-Subsequence, {4th Digit of Group Member 1, 10, 2, 4th Digit of Group Member 2, 20}

solve all these with C++ code and solve them manually