A Travelling salesman tourist is to travel the length and breadth of Barbados using his own GPS tracker to navigate. This GPS tracker stores a set of heuristic search graph algorithms. Derive a complete and as realistic as possible the nationwide search graph from the points in Figure 1.0 to show how you could perform a complete traversal using (i) A* search without heuristics (ii) A* Search with dynamic heuristics. (ii) Best First Search without heuristics (iii) Best First Search with dynamic heuristics (v) A Heuristic Greedy Search.(vi) A heuristic Depth First Search (vii) A heuristic Breadth First Search. Your are expected to design a non-trivial heuristics table for all the points highlighted in the search graph as a part of your design. Goal cost nodes are also to be factually determined as a part of the Travelling salesman GPS tracking. You are expected to show all mathematical computations and derivations as a construct to the solutions in this problem. You may have to re-size this map to ensure you capture the distance coordinates as required. You will also be expected to make assumptions on the heuristics used to facilitate the computation.