1) Consider the following network topology: Assume the original routing table in D is as below. Now suppose that D receives from A the following advertisement: Will the table in D change? If so how? 2) Consider the following network. With the indicated link costs, use Dijkstra’s shortest-path algorithm to compute the shortest path from z to all network nodes. Show how the algorithm works by computing a table similar to the following table: