For the graph below, show how the Dijkstra's Algorithm for Weighted Graph finds the shortest path from Bucharest to Rimnicu Vilcea. For each iteration, show the content of the priority queue. The priority queue contains triples (to, from, cost). Note that multiple triples with the same to node can occur in the priority queue. However, do not add another triple if you have already encountered a better path to 'to! Note: To save time, no need to use full name of the cities ex, Rimnicu Vilcea can be referred to as Rim Oradea 71/ Neamt Zerind 87 151 75 Arad lasi 140 92 Sibiu 99 Fagaras 118 Vaslui 80 Timisoara Rimnicu Vilcea 142 Lugoj 211 Pitesti 97 70 Mehadia 146 Hirsova 101 85 138 86 75 Drobeta 98 Urziceni Bucharest 90 Giurgiu 120 Craiova Eforie