please solve it as soon as possible i have a final quiz now

thank you

Consider the following network. With the indicated link costs, use Dijkstra's shortest-path algorithm to do the following: A)-(10 pts) Compute the shortest path from t to all network nodes. Show how the algorithm works by filling in the following information in the given table. B)- (5 pts) Draw the obtained shortest-path tree. Step N' D(x) , p(x) D(u),plu) D(V).p(v) D(w),p(w) Dly),ply) . 0 1 2 3 4 5 6 2 ano D(z),p(z)