Using a min-priority queue (min-heap), Dijkstra's Algorithm runs in O((V + E) log V) time with O(V + E) space complexity, where V is number of vertices & E is the number of edges. One important…