Problem 5. Use Dijkastra's algorithm to find the shortest path from node 5 to node 6 of the following undirected graph (i.e., the weights wij Wii). The number on each edge indicates its weight. 1)...

Please do as much as you can. Anything will help to help me understand this problem. Thank you so much

Extracted text: Problem 5. Use Dijkastra's algorithm to find the shortest path from node 5 to node 6 of the following undirected graph (i.e., the weights wij Wii). The number on each edge indicates its weight. 1) Show the result of each iteration. You are recommended showing the iterations in an Excel sheet with name "Problem 5". 2) Explicitly show the shortest path on the graph or, (draw one if you cannot print), and calculate the minimum total distance from nodes 5 to 6. 10 57 65 21 29 40 14 4 32 11 8 12 30 11 40 ని 6. 9.