Problem $3(21$ points$)$: Consider the following network. Note that there are edges in this network which can be traveled in both directions. If an edge $(i,j)$ has cost $c_{ij},$ this cost is the same regardless of which direction the edge is traversed $($e$.$g$.,$ c

a$.(12$ points$)$ Use Dijkstra's algorithm to find the shortest path from node $0$ to node $8.$ To earn full credit you must accurately fill in the table that shows all of the steps of the algorithm.

$\backslash$table$[[\backslash$table$[[$Order Made$],[$Permanent$]],$Node,Label,Predecessor$],[,0,,],[,1,,],[,2,,],[,3,,],[,4,,],[,5,,],[,6,,],[,7,,],[,8,,]]$

PATH:

Distance: