For each of the following problems, you have to provide a table to show the action of Dijkstra's Algorithm for finding the shortest path between two vertices. And you are required to provide the shortest path and its length at the end.