Find the shortest path from a to h using Dijkstra algorithm in the following weighted graph-

for detail of this question check images that given .png

(c) Find the shortest path from a to h using Dijkstra algorithm in the following weighted graph- b 12 15/ n 10 C 4 11 a 14 h 13 3 5 4 Marks