Write a Java programs for two strategies to maximize the value of items in a knapsack without exceeding its weight limit. First, use Dynamic Programming to create a table that calculates the maximum value. Then, apply a Greedy Algorithm by sorting items based on value-to-weight ratio. To make it easier to understand: Input: Enter the number of items. For each item, enter its weight and value. Enter the knapsack's weight capacity. Dynamic Programming: - Calculate the maximum value using Dynamic Programming. Greedy Algorithm: - Calculate the maximum value using a Greedy Algorithm based on value-to- weight ratio. Results: - See the maximum values for both methods. Expected Output: Enter the number of items: 3 Enter the weight and value of each item: 24 35 46 Enter the knapsack capacity: 5 Dynamic Programming Solution: 9 Greedy Algorithm Solution: 9