Texts: 1. Include a table that shows the step-by-step execution of Dijkstra's algorithm.2. Show step-by-step with the names of the places.3. You are presented with a map of Governors Island, represented as a graph, with various intersections as nodes and streets as edges. Your task is to find the shortest path from "Soissons Landing" (the starting location) to "Picnic Point" (the destination) using Dijkstra's algorithm. Along the way, you need to document each step of the algorithm to understand