Please show me the answer directly.
4 (10 pts) Consider the following network. Using the link state algorithm and showing your work using a table, compute the forwarding table for router w. [Note that each entry in a forwarding table consists of a destination and the next hop along the path towards the destination.]