You are given the following distances between $6$ cities. Note that the $0$ value indicates there is no connection between cities. You are located at City $1$ and would like to go to City $5.$ Follow two greedy heuristics to find the shortest path to City $5$ starting from City $1,$ and provide the route and the distance associated with the route you find.

Heuristic $1$: Starting from City $1,$ go to the closest city until you reach City $5.$

 

 mple$($with different distances$)$that will not provide a feasible solution to the problem when you use Heuristic $1.$