For the following two questions, consider the following network, consisting of routers A$,$ B$,$ C$.$ D$,$ and E$,$

and shown link numbers with costr all equal to $1.$ So for example, A and $D$ are connected by link $$3$ and

its cost is $1.$ Note that the routers use distance vector.

Assume that when the network is brought up$,$ the routing tables at the routers consist of only one entry,

which is that each router can reach itself with a cost of zero. Thus, the distance vector that is sent initially

by router A for example is therefore just $A=0.$

Assume that B receives this distance vector from A before starting to broadeast its distance vector,

what will be the routing table at $B$ just after receiving the distance vector of $A?$

$($The format of the routing table is :$($:$D,$local,$0$:$),($:$A,3,2$:$),($:$B,3,2$:$),($:$E,6,1$:$),($:$C,6,2$:$)$:$)$:$0>,($:$A,3,1$:$),($:$B,3,2$:$),($:$E,6,1$:$),($:$C,6,3$:$)$:: local, $0>,>$

$c$