Consider the following graph:

Using Dijkstra's Algorithm, find the minimum spanning tree with root at node $\text{'}y\text{'}.$ Show all the steps in the Algorithm by completing the following table and draw the minimum spanning tree.

$\backslash$table$[[$Step$,N^{\text{'}},D(1),p(),D(1),p(),D(1),p(),,D(1),p()$