From 0/1 knapsack to bounded knapsack

Start with the 0/1 knapsack: items with weights and values, a capacity, and each item used at most once; return the best total value. Then each item may be used up to a given count. Extend the DP, first naively and then efficiently (for example by splitting counts into powers of two), and compare the complexities.