In Java

Task #2-0/1 Knapsack Use Dynamic programming approach to implement 0/1 knapsack problem. a. Ask user for knapsack capacity d profits or read an input.txt that contains n objects weights and profits. List objects that maximize the profit and show the knapsack capacity. (60 Pts) maximum profit as output considering c