A lattice point is a point on the xy-plane where each coordinate is an integer. One way of
measuring distance, in a system called taxicab Geometry, only allows horizontal or
vertical movement. In this system, the shortest distance from the point (0, 0) to the point
(3, 4) is 7. A path is needed to connect these four points : . What is the shortest possible
path that goes through all four of these points and returns to the starting point. Does the
path order matter here?