Exercise # 1: Dijkstra's Algorithm (a) Write a function named getShortestPath (graph, from, to) that takes a graph as an input and estimates the shortest distance between a node "from" to a node "to"....

Use python

Extracted text: Exercise # 1: Dijkstra's Algorithm (a) Write a function named getShortestPath (graph, from, to) that takes a graph as an input and estimates the shortest distance between a node "from" to a node "to". Example 1: Input Graph: Adjacency list of the following graph. 10 From: A To: G [ПА, В), (8, С), (С, 6)) Output That is, the output shows that the shortest path to reach "G" from "A" is through the nodes B and C.