Consider the following map:
1. Develop two simple heuristics to visit all highlighted squares (Travelling salesperson) travelling the minimal distance: moving one cell = 1 unit. You can only travel horizontally and vertically (Manhattan distance).
2. Determine the optimal distance applying the developed heuristic (3 attempts for each heuristic).