Question 9
A beaver swims from town A to town J only downstream, following arrows. Each river label is the number of logs collected on that river. The beaver chooses a route collecting as many logs as possible.
How many towns does this route pass through, excluding A and J?
How many towns does this route pass through, excluding A and J?