Consider the following network. With the indicated link costs, use Dijkstra's shortestpath algorithm to compute the shortest path from $x$ to $t$ and $u$ to $z.$ Show how the algorithm works by computing a table similar to Table in the book. Draw the shortest path diagram and define forwarding tables for $x.$ HEY TEACHER COULD YOU PLEASE EXPLAIN IT IN DETAILS AND MORE EASY WAY $,$ THANK YOU