Consider the network shown below. Using Dijkstra's routing $($Link$-$State$)$ algorithm, compute the shortest path from $x$ to $t.$

$\backslash$table$[[$Step$,{}^{}$N',D(y),p(y),D(w),p(w),D(v),p(v),D(u),p(u),D(t),p(t)