2. Dynamic Programming You are planning a hiking trip and have decided to carry up to 10 Kg of load in your knapsack. To keep it simple, you are considering carrying only three items listed in the table below along with their weights and values. You may carry more than one of each item, and are wondering how many of each item to take with you in order to maximize the value while not exceeding the 10 Kg limit. Use dynamic programming (DP) to solve this problem. (also define stages, states, and recursive equations of this DP) (30 points) Weight (kg) value 3 7 Item food pack Large bottle of water tent 4 6 8 11 2. Dynamic Programming You are planning a hiking trip and have decided to carry up to 10 Kg of load in your knapsack. To keep it simple, you are considering carrying only three items listed in the table below along with their weights and values. You may carry more than one of each item, and are wondering how many of each item to take with you in order to maximize the value while not exceeding the 10 Kg limit. Use dynamic programming (DP) to solve this problem. (also define stages, states, and recursive equations of this DP) (30 points) Weight (kg) value 3 7 Item food pack Large bottle of water tent 4 6 8 11