1. Given a set of positive integers X={x1,x2,,xn}, and an integer B, find a subset of X that has maximum sum not exceeding B. Write a dynamic programming algorithm that returns subset of integers. Example: X: {20,30,14,70,40,50,15,25,80,60,10,95:99} Find a subset of X with maximum sum not exceeding 99 . An optimal solution: 1358 with sum 20+14+40+25=99