Consider the following network.
a) With the indicated link costs, use Djkstra's shortest path algorithm to compute the shortest path from E to all network nodes. Show how the algorithm works by computing a table.
b) Eliminate node A, and redo the problem starting from node B.