Problem
1. Show that an optimal picker route cannot traverse an aisle (or a portion of an aisle) more than twice. Illustrate how this property can be used to devise a dynamic programming algorithm.
2. Demonstrate that both the FF and BF heuristics for the 1-BP problem take O(m log m) steps.