Please dont copy the answer from elsewhere. I need help with the question below. The keyword of the question is $"$to all network nodes." Please provide clear steps if you can.

Consider the shown network with the indicated link costs. Use Dijkstra's shortest$-$path algorithm to

compute the shortest path from node $\text{'}w\text{'}$ to all network nodes. Repeat for node $\text{'}y\text{'}.$ Show how the

algorithm works by constructing a table.

points$]$