Problem $2.$ Use Dijkstra's method to compute the shortest path from node $9$ to node $7.$ Please write down the table with all the iterations. In your solution, you should also provide the path $($make sure you record the "previous node" when you perform any update$)$ and the corresponding length.