Question 30
The following diagram shows paths (edges in the grid) connecting 5 × 4 lattice points. Each path is exactly 1 meter long. Determine the shortest distance (in meters) a person needs to travel so that he will walk through each path at least once and returns to the starting position.
