Build a routing table from a in the above graph.

Fill in the tables below.

$D(x)$ is total distance to $x.p(x)$ is the most recent predecessor node to $x.$ N$\text{'}$ is the collection of

visited noder. List the node most recently added to $N\text{'}$ in that space. Use $"-"$ in both blanks

after adding the node to N$\text{'}.$ Use $"$s$"$ in both blanks when a node is unreachable.