You are given the following topology and a random state of routing table distances

The arrows in the figure below denotes the direction of updates that are being sent. For example the two way arrow between nodes 9 and 4 refers that updates were sent from both nodes to each other, and the one way arrow between nodes 5 and 2 refers that node 5 just received update from node 2.

Considering only those neighbor updates just received by node 10, calculate the updated cost value for the destination nodes 1 and 2 from the source node 10

2 9 4 4 1 1 4 5 1 3 4 15 3 10 8 8 5 2 3 6 2 8 1 00 8 7 6 3 2 N 2 3 5 8 9 0 0 0 1 3 inf inf 1 7 en 2 inf 5 1 4 2 0 1 1 3 1 1 0 1 0 6 4 10 6 5 inf 12 inf 12 inf 6 5 5 1 1 0 4 7 4 5 6 13 12 4 5 4 20 inf 2 4 inf 2 4 6 4 6 5 0 5 inf inf inf 2 inf 6 5 6 9 2 inf 2 0 1 inf inf inf 7 14 13 15 inf inf inf 1 0 1 inf 8 12 inf 31 inf 3 inf 1 0 3 1 6 inf 5 14 inf inf 6 5 5 1 6 0 6 Q Q 8 2 2 inf inf inf 7 8 ANW O 9 15 inf 20 inf co 15 31 inf 3 4 3 0 3 9 10 1 0 12 12 15 1 Du(v) c(u,n) Dn(v) Result min{ + + } Du(v) c(u,n) Dn(v) Result min{ + + 11 }