knapsack problem.a hiker has a 5-ft^3 backpack and needs to decide on the must valuable items to take on the hiking trip.there are three items from which to choose. their volumes are 2,3 and 4ft^3. and the hiker estimates their associated values on a scale from 0 to 100 as 30, 50 and 70,respectively. express the problem as longest route network, and find the optimal solution.