$(40$ Points$)$ Consider the following network. With the indicated link costs, use Dijkstra's shortest$-$path algorithm to compute the shortest path from $x$ to all network nodes. Show how the algorithm works by computing a table similar to what we use in the lecture note. Also draw the resulting shortest$-$path tree from $x$ to all nodes and the resulting forwarding table in x $.$