Question $1$: Dijkstra's Algorithm

Problem Statement

Given a weighted, directed graph $($Figure $1)$ representing a city's road network, find the shortest path from the starting location, Node A$,$ to each of the other nodes. Use Dijkstra's algorithm to determine the shortest path and the minimum distance to each node.

Graph

The directed graph is shown below with edge weights:

Figure $1$: Grapn $1$

Instructions $($Detail each step$)$

$1.$ Start from Node A$.$

$2.$ Calculate the shortest path from Node A to each of the other nodes using Dijkstra's algorithm.

$3.$ Provide the shortest path distance for each node and the sequence of nodes traveled for each path.