IMPLEMENT IN JAVA

2. First apply greedy approach to solve this 0-1 knapsack problem. After that solve the given problem using dynamic programming approach. Compare the results between dynamic programming and greedy approach, which approach gives optimal result? Find out the maximum profit and which items should be picked up. (Knapsack Weight=25). [10] Items Profit Weight 1 24 24 2 18 10 3 18 10 4 10 7