For the following network, compute the forwarding table of router A using the link state routing algorithm.
a. Step one - run Dijkstra's Shortest Path algorithm.
b. Step two - construct the shortest path tree where router A is the root.
c. Step three - build the forwarding table.