Dynamic Programming·Choosing a Subset·FoundationThe two branchesA knapsack cell considers item i with capacity c remaining.What are the two values it compares?ATaking it, or taking the next item instead, whichever is worth moreBIts value divided by its weight, against the same ratio for the next itemCIts value, or the total room left, whichever number is largerDSkipping it, or its value plus the best from the rest with less roomCheck answer