Find the shortest path from node s to every other node in the network shown below using Dijkstra's algorithm. Clearly show the tables you create for Dijkstra's algorithm.

Step $1$

$\backslash$table$[[\backslash$table$[[$Permanent$],[$node$],[$order$]],$Node,Label,Predecessor$],[,$s$,,],[,$a$,,],[,$b$,,],[,$c$,,],[,$d$,,]]$

$($b$)$ what is the shortest path and distance to node d$?$

$($c$)$ what is the shortest path and distance to node c$?$