How does this work? The first table extends all the way to D$($f$),$ p$($f$).$

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 nodes. List the node most recently added to $N\text{'}$ in that space. Use $"-"$ in both blanks

after adding the node to N$.$ Use $""$ in both blanks when a node is unreachable.

Routing Table: