a) Devise a dynamic programming algorithm similar to Knapsack to solve this problem.

b) Determine an asymptotic running time for your solution and justify your result.

"Gotta spend!" Every time you receive your paycheque, you pay W dollars towards your credit card bill mmediately afterwar he/she has a massive wishlist of n items S -{si,..., sn), where each item si has a cost c Assuming each item on the wishlist "needs" to be purchased at most once, the goal is to determine whether it is possible to purchase a group of items whose total cost uses up exactly all of the W dollars that you struggled to pay