Show work. Double checking my work (hw). Thank you.

Consider the following network diagram, and assume that each node initially knows the costs to each of its neighbors. Using the distance-vector algorithm, fill out the distance tables with entries at node z, in the format shown below the network diagram. (This is similar to slide 5-23 and Figure 5.6, page 387 of the textbook.). 3 Cost to Node From Node NX