Write a C program for the following problem. There are n items in a house. A thief breaks into that house and the constraint is that the thief cannot carry more weight than W. The thief by now knows the weight and profit value of each item in the house. Devise an algorithm using dynamic programming strategy to find out which items the thief should steal so that he can carry a max. weight of W. (CO1) For example n=4W=5 Weights of items : 2132 Profits of items : 12102015 Output: 1101 For example